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.r135-tall-171631131300548.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 greatspnxred
Input is DoubleExponent-PT-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 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 DoubleExponent-PT-004-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716376506951

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:15:08] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-22 11:15:08] [INFO ] Transformed 216 places.
[2024-05-22 11:15:08] [INFO ] Transformed 198 transitions.
[2024-05-22 11:15:08] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 40 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 31 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2024-05-22 11:15:08] [INFO ] Computed 21 invariants in 14 ms
[2024-05-22 11:15:09] [INFO ] Implicit Places using invariants in 452 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 484 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 26 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:15:09] [INFO ] Computed 19 invariants in 7 ms
[2024-05-22 11:15:09] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 11:15:09] [INFO ] Invariant cache hit.
[2024-05-22 11:15:09] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1070 ms. Remains : 209/216 places, 197/198 transitions.
Support contains 40 out of 209 places after structural reductions.
[2024-05-22 11:15:09] [INFO ] Flatten gal took : 40 ms
[2024-05-22 11:15:09] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:15:10] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 39 out of 209 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (1344 resets) in 2371 ms. (16 steps per ms) remains 19/28 properties
BEST_FIRST walk for 4001 steps (116 resets) in 154 ms. (25 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (112 resets) in 219 ms. (18 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (109 resets) in 151 ms. (26 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (114 resets) in 178 ms. (22 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (114 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (114 resets) in 71 ms. (55 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (113 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (115 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (109 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (110 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (117 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (111 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (111 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (119 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (111 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (110 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (114 resets) in 51 ms. (76 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (112 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
[2024-05-22 11:15:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 9/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 122/165 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 9/174 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 183/357 variables, 174/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 42/399 variables, 31/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 4/403 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 3/406 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:15:12] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 17 ms to minimize.
[2024-05-22 11:15:13] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:15:13] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:15:13] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:15:13] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/406 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 233 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 9/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 122/165 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 9/174 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 183/357 variables, 174/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 42/399 variables, 31/232 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 11/243 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/399 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 4/403 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 3/406 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/406 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 252 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
After SMT, in 6110ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 4746 ms.
Support contains 27 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 207 transition count 164
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 176 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 173 transition count 161
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 70 place count 173 transition count 153
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 86 place count 165 transition count 153
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 144 place count 136 transition count 124
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 133 transition count 124
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 160 place count 133 transition count 114
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 170 place count 123 transition count 114
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 185 place count 123 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 122 transition count 113
Applied a total of 186 rules in 98 ms. Remains 122 /209 variables (removed 87) and now considering 113/197 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 122/209 places, 113/197 transitions.
RANDOM walk for 40000 steps (5050 resets) in 721 ms. (55 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4001 steps (346 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (326 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (350 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (324 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (336 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (332 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (343 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (344 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (334 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (338 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (344 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (325 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (359 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (333 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (334 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (338 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
// Phase 1: matrix 113 rows 122 cols
[2024-05-22 11:15:22] [INFO ] Computed 19 invariants in 20 ms
[2024-05-22 11:15:22] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:22] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 46/115 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 18 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 8 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 4 ms to minimize.
[2024-05-22 11:15:23] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-22 11:15:24] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/117 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 2/119 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 113/232 variables, 119/164 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:25] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 3/235 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/235 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/235 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 179 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 122/122 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 46/115 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/117 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 2/119 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 113/232 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 9/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 15/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:15:27] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:15:28] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2024-05-22 11:15:28] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:15:28] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 11:15:28] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/232 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 3/235 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/235 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/235 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/235 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 0/235 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 207 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2169 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 122/122 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 41/41 constraints]
After SMT, in 6344ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1517 ms.
Support contains 22 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 113/113 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 112
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 2 place count 121 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 117 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 116 transition count 108
Applied a total of 12 rules in 16 ms. Remains 116 /122 variables (removed 6) and now considering 108/113 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 116/122 places, 108/113 transitions.
RANDOM walk for 40000 steps (5121 resets) in 242 ms. (164 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (336 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (326 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (332 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (326 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (349 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (338 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (357 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (314 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (354 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (326 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (345 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (347 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (352 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (346 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (337 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (352 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 316307 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :11 out of 16
Probabilistic random walk after 316307 steps, saw 158182 distinct states, run finished after 3005 ms. (steps per millisecond=105 ) properties seen :11
// Phase 1: matrix 108 rows 116 cols
[2024-05-22 11:15:33] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 11:15:33] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 4 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:15:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/111 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 108/219 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/224 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/224 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 159 constraints, problems are : Problem set: 0 solved, 5 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/111 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 108/219 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 5/224 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/224 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 164 constraints, problems are : Problem set: 0 solved, 5 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 1305ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1764 ms.
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 108/108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 114 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 113 transition count 105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 106 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 103 transition count 98
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 103 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 100 transition count 95
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 100 transition count 95
Applied a total of 35 rules in 29 ms. Remains 100 /116 variables (removed 16) and now considering 95/108 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 100/116 places, 95/108 transitions.
RANDOM walk for 40000 steps (5158 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3355 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3400 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3426 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3366 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 330369 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 5
Probabilistic random walk after 330369 steps, saw 165273 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 95 rows 100 cols
[2024-05-22 11:15:40] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 11:15:40] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 41/91 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4/95 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:40] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 95/190 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 13/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/195 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/195 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 140 constraints, problems are : Problem set: 0 solved, 5 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 100/100 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 41/91 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4/95 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 95/190 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 5/195 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/195 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/195 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 146 constraints, problems are : Problem set: 0 solved, 5 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 100/100 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 915ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2446 ms.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 100/100 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-22 11:15:43] [INFO ] Invariant cache hit.
[2024-05-22 11:15:43] [INFO ] Implicit Places using invariants in 78 ms returned [23, 29, 68, 73, 91, 97]
[2024-05-22 11:15:43] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/100 places, 95/95 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 94
Applied a total of 2 rules in 6 ms. Remains 97 /98 variables (removed 1) and now considering 94/95 (removed 1) transitions.
// Phase 1: matrix 94 rows 97 cols
[2024-05-22 11:15:43] [INFO ] Computed 17 invariants in 2 ms
[2024-05-22 11:15:43] [INFO ] Implicit Places using invariants in 72 ms returned [23, 29, 88, 94]
[2024-05-22 11:15:43] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 95/100 places, 94/95 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 95 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 93
Applied a total of 2 rules in 7 ms. Remains 94 /95 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 94 cols
[2024-05-22 11:15:43] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:15:43] [INFO ] Implicit Places using invariants in 64 ms returned [23, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 92/100 places, 93/95 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 92
Applied a total of 2 rules in 6 ms. Remains 91 /92 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 91 cols
[2024-05-22 11:15:43] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:15:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:15:44] [INFO ] Invariant cache hit.
[2024-05-22 11:15:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:15:44] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 91/100 places, 92/95 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 522 ms. Remains : 91/100 places, 92/95 transitions.
RANDOM walk for 40000 steps (5818 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3656 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3729 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3689 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3619 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3595 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 372625 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 5
Probabilistic random walk after 372625 steps, saw 186349 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-22 11:15:47] [INFO ] Invariant cache hit.
[2024-05-22 11:15:47] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 16/86 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:15:47] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:15:48] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:15:48] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:15:48] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 11:15:48] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 92/178 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 5/183 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 129 constraints, problems are : Problem set: 0 solved, 5 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 16/86 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 92/178 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 5/183 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/183 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 134 constraints, problems are : Problem set: 0 solved, 5 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
After SMT, in 880ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2004 ms.
Support contains 8 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 92/92 transitions.
Applied a total of 0 rules in 12 ms. Remains 91 /91 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 91/91 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:15:50] [INFO ] Invariant cache hit.
[2024-05-22 11:15:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 11:15:50] [INFO ] Invariant cache hit.
[2024-05-22 11:15:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:15:50] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-22 11:15:50] [INFO ] Redundant transitions in 1 ms returned []
Running 91 sub problems to find dead transitions.
[2024-05-22 11:15:50] [INFO ] Invariant cache hit.
[2024-05-22 11:15:50] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 11:15:51] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:15:52] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:15:52] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 92/183 variables, 91/114 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 127 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2752 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 11:15:53] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:15:54] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 92/183 variables, 91/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 91/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 220 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3510 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
After SMT, in 6298ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 6302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6593 ms. Remains : 91/91 places, 92/92 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 90 transition count 91
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 90 transition count 85
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 84 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 81 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 81 transition count 82
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 80 transition count 81
Applied a total of 22 rules in 15 ms. Remains 80 /91 variables (removed 11) and now considering 81/92 (removed 11) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 81 rows 80 cols
[2024-05-22 11:15:57] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 11:15:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:15:57] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:15:57] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-22 11:15:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:15:57] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:3
TRAPS : Iteration 0
[2024-05-22 11:15:57] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 11:15:57] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 11:15:57] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 11:15:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-22 11:15:57] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:15:57] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 11:15:57] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 11:15:57] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:15:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-05-22 11:15:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:15:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 2
[2024-05-22 11:15:57] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 11:15:57] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 538 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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((G(p0)||(p1 U X(p2)))))'
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:15:57] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 11:15:58] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 11:15:58] [INFO ] Invariant cache hit.
[2024-05-22 11:15:58] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:15:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:16:01] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:16:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:16:03] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:16:03] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:16:03] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:16:04] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 3 ms to minimize.
[2024-05-22 11:16:04] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:16:04] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:16:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:16:05] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:16:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:16:06] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:16:06] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:16:07] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:16:09] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 17428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:16:25] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:16:35] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 47474ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47479ms
Finished structural reductions in LTL mode , in 1 iterations and 47857 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 441 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-00
Product exploration explored 100000 steps with 3562 reset in 219 ms.
Product exploration explored 100000 steps with 3581 reset in 156 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 147 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1327 resets) in 113 ms. (350 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40000 steps (1193 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1192 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1187 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1196 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1159 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1192 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
[2024-05-22 11:16:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 6/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 84/159 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 180/350 variables, 170/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 46/396 variables, 33/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 5/401 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 4/405 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf8 is UNSAT
At refinement iteration 17 (OVERLAPS) 1/406 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/406 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 228 constraints, problems are : Problem set: 1 solved, 6 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/75 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/159 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 3/19 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 180/350 variables, 170/189 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 46/396 variables, 33/222 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 6/228 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 11:16:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:16:48] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:16:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:16:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 4/232 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 5/401 variables, 3/235 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/405 variables, 2/237 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/406 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 11:16:49] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:16:49] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:16:49] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/406 variables, 3/241 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/406 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/406 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 241 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 1954ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3478 ms.
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 152
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 164 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 161 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 94 place count 161 transition count 138
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 116 place count 150 transition count 138
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 180 place count 118 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 112 transition count 106
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 205 place count 112 transition count 93
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 218 place count 99 transition count 93
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 233 place count 99 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 98 transition count 92
Applied a total of 234 rules in 24 ms. Remains 98 /209 variables (removed 111) and now considering 92/197 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 98/209 places, 92/197 transitions.
RANDOM walk for 40000 steps (4511 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2609 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2692 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2680 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3118 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3122 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2701 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 361623 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 6
Probabilistic random walk after 361623 steps, saw 180898 distinct states, run finished after 3008 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 92 rows 98 cols
[2024-05-22 11:16:56] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 11:16:56] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 41/93 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 92/185 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:16:56] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/190 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 127 constraints, problems are : Problem set: 0 solved, 6 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 98/98 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 41/93 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 92/185 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:16:57] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 5/190 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 98/98 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1004 ms.
Support contains 7 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 98/98 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:16:58] [INFO ] Invariant cache hit.
[2024-05-22 11:16:58] [INFO ] Implicit Places using invariants in 87 ms returned [23, 29, 65, 71, 89, 95]
[2024-05-22 11:16:58] [INFO ] Actually due to overlaps returned [71, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/98 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 103 ms. Remains : 96/98 places, 92/92 transitions.
RANDOM walk for 40000 steps (4537 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2642 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2684 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2729 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3098 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3116 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2666 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 359184 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 6
Probabilistic random walk after 359184 steps, saw 179681 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 92 rows 96 cols
[2024-05-22 11:17:02] [INFO ] Computed 17 invariants in 3 ms
[2024-05-22 11:17:02] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/91 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 92/183 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/188 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 123 constraints, problems are : Problem set: 0 solved, 6 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/91 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 92/183 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 5/188 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:17:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/188 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/188 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 136 constraints, problems are : Problem set: 0 solved, 6 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 873ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1419 ms.
Support contains 7 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:17:04] [INFO ] Invariant cache hit.
[2024-05-22 11:17:04] [INFO ] Implicit Places using invariants in 91 ms returned [23, 29, 87, 93]
[2024-05-22 11:17:04] [INFO ] Actually due to overlaps returned [93, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/96 places, 92/92 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 91
Applied a total of 2 rules in 5 ms. Remains 93 /94 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 93 cols
[2024-05-22 11:17:04] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:17:04] [INFO ] Implicit Places using invariants in 69 ms returned [23, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/96 places, 91/92 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 90
Applied a total of 2 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 90 cols
[2024-05-22 11:17:04] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 11:17:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:17:04] [INFO ] Invariant cache hit.
[2024-05-22 11:17:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 11:17:04] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 90/96 places, 90/92 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 431 ms. Remains : 90/96 places, 90/92 transitions.
RANDOM walk for 40000 steps (4529 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2664 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2681 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2676 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3101 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3136 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2693 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 314837 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 6
Probabilistic random walk after 314837 steps, saw 157484 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-22 11:17:08] [INFO ] Invariant cache hit.
[2024-05-22 11:17:08] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 41/73 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/83 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/85 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 90/175 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 5/180 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 112 constraints, problems are : Problem set: 0 solved, 6 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 41/73 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 10/83 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:17:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/85 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 90/175 variables, 85/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 5/180 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/180 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 126 constraints, problems are : Problem set: 0 solved, 6 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 785ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1256 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-22 11:17:10] [INFO ] Invariant cache hit.
[2024-05-22 11:17:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:17:10] [INFO ] Invariant cache hit.
[2024-05-22 11:17:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 11:17:10] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-22 11:17:10] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-22 11:17:10] [INFO ] Invariant cache hit.
[2024-05-22 11:17:10] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:17:11] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:17:11] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:17:11] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:17:11] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:17:11] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/180 variables, 90/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:17:12] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:12] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/180 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 0/180 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 90/180 variables, 90/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 89/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:17:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:15] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 213 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 12/12 constraints]
After SMT, in 7100ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7359 ms. Remains : 90/90 places, 90/90 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 90 transition count 84
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 82 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 82 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 81 transition count 81
Applied a total of 18 rules in 9 ms. Remains 81 /90 variables (removed 9) and now considering 81/90 (removed 9) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 11:17:17] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 11:17:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:17] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:17:17] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 11:17:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:17] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:17] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 11:17:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:17:17] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 11:17:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:17:17] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-22 11:17:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2024-05-22 11:17:17] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
TRAPS : Iteration 1
[2024-05-22 11:17:17] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 11:17:17] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 547 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 19 factoid took 336 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 316 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:17:18] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 11:17:19] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 11:17:19] [INFO ] Invariant cache hit.
[2024-05-22 11:17:19] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:17:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:17:22] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-22 11:17:22] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:17:27] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:17:27] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:17:28] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:17:30] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 17299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:17:55] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 47339ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47343ms
Finished structural reductions in LTL mode , in 1 iterations and 47709 ms. Remains : 209/209 places, 197/197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1325 resets) in 76 ms. (519 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40000 steps (1189 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1190 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1139 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1153 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
[2024-05-22 11:18:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 84/159 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 180/350 variables, 170/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 46/396 variables, 33/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/401 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/405 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/406 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:07] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:07] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:18:07] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/406 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 231 constraints, problems are : Problem set: 0 solved, 4 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 84/159 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 180/350 variables, 170/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 46/396 variables, 33/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:08] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/401 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/401 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/405 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/406 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/406 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/406 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 236 constraints, problems are : Problem set: 0 solved, 4 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3136 ms.
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 152
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 164 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 161 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 94 place count 161 transition count 138
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 116 place count 150 transition count 138
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 180 place count 118 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 112 transition count 106
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 205 place count 112 transition count 93
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 218 place count 99 transition count 93
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 233 place count 99 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 98 transition count 92
Applied a total of 234 rules in 37 ms. Remains 98 /209 variables (removed 111) and now considering 92/197 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 98/209 places, 92/197 transitions.
RANDOM walk for 40000 steps (4547 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2710 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2636 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3130 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3114 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 352021 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 4
Probabilistic random walk after 352021 steps, saw 176103 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
// Phase 1: matrix 92 rows 98 cols
[2024-05-22 11:18:14] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 11:18:14] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:14] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 41/93 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:18:14] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:18:14] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:18:15] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:18:15] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 92/185 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/190 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 132 constraints, problems are : Problem set: 0 solved, 4 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 98/98 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 41/93 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 92/185 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/190 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 137 constraints, problems are : Problem set: 0 solved, 4 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 98/98 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 643ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1717 ms.
Support contains 7 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:18:17] [INFO ] Invariant cache hit.
[2024-05-22 11:18:17] [INFO ] Implicit Places using invariants in 76 ms returned [23, 29, 65, 71, 89, 95]
[2024-05-22 11:18:17] [INFO ] Actually due to overlaps returned [71, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/98 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87 ms. Remains : 96/98 places, 92/92 transitions.
RANDOM walk for 40000 steps (4533 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2643 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2676 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3191 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3123 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 369742 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 4
Probabilistic random walk after 369742 steps, saw 184962 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 92 rows 96 cols
[2024-05-22 11:18:20] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 11:18:20] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/91 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 92/183 variables, 91/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/188 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 131 constraints, problems are : Problem set: 0 solved, 4 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/91 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 92/183 variables, 91/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/188 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/188 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/188 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 137 constraints, problems are : Problem set: 0 solved, 4 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 818ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 781 ms.
Support contains 7 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:18:21] [INFO ] Invariant cache hit.
[2024-05-22 11:18:22] [INFO ] Implicit Places using invariants in 67 ms returned [23, 29, 87, 93]
[2024-05-22 11:18:22] [INFO ] Actually due to overlaps returned [93, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/96 places, 92/92 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 91
Applied a total of 2 rules in 4 ms. Remains 93 /94 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 93 cols
[2024-05-22 11:18:22] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 11:18:22] [INFO ] Implicit Places using invariants in 61 ms returned [23, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/96 places, 91/92 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 90
Applied a total of 2 rules in 5 ms. Remains 90 /91 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 90 cols
[2024-05-22 11:18:22] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:18:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 11:18:22] [INFO ] Invariant cache hit.
[2024-05-22 11:18:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 11:18:22] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 90/96 places, 90/92 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 368 ms. Remains : 90/96 places, 90/92 transitions.
RANDOM walk for 40000 steps (4518 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2597 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2652 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3136 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3153 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 388074 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 4
Probabilistic random walk after 388074 steps, saw 194125 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-22 11:18:25] [INFO ] Invariant cache hit.
[2024-05-22 11:18:25] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 41/73 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/83 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/85 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 90/175 variables, 85/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/180 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/180 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 118 constraints, problems are : Problem set: 0 solved, 4 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 41/73 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/83 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:18:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/85 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 90/175 variables, 85/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/180 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/180 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/180 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/180 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/180 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 789 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-22 11:18:26] [INFO ] Invariant cache hit.
[2024-05-22 11:18:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:18:26] [INFO ] Invariant cache hit.
[2024-05-22 11:18:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 11:18:27] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-22 11:18:27] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-22 11:18:27] [INFO ] Invariant cache hit.
[2024-05-22 11:18:27] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:18:27] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:27] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:27] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:18:28] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:28] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/180 variables, 90/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:18:29] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:29] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/180 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 0/180 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2971 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:18:30] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:18:30] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 90/180 variables, 90/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 89/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 213 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4079 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 12/12 constraints]
After SMT, in 7076ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7317 ms. Remains : 90/90 places, 90/90 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 90 transition count 84
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 82 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 82 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 81 transition count 81
Applied a total of 18 rules in 4 ms. Remains 81 /90 variables (removed 9) and now considering 81/90 (removed 9) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 11:18:34] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:34] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:34] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 11:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:18:34] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 11:18:34] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:34] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:18:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:18:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 178 ms
TRAPS : Iteration 1
[2024-05-22 11:18:34] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 11:18:34] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 484 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 332 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 305 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3602 reset in 105 ms.
Product exploration explored 100000 steps with 3587 reset in 117 ms.
Applying partial POR strategy [true, true, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 395 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 208 transition count 196
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 45 place count 208 transition count 202
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 208 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 204 transition count 198
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 204 transition count 198
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 96 place count 204 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 203 transition count 203
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 203 transition count 203
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 203 transition count 241
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 196 transition count 227
Deduced a syphon composed of 82 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 196 transition count 227
Deduced a syphon composed of 82 places in 0 ms
Applied a total of 119 rules in 34 ms. Remains 196 /209 variables (removed 13) and now considering 227/197 (removed -30) transitions.
[2024-05-22 11:18:36] [INFO ] Redundant transitions in 7 ms returned []
Running 226 sub problems to find dead transitions.
// Phase 1: matrix 227 rows 196 cols
[2024-05-22 11:18:36] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:18:36] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 11:18:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-22 11:18:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 225 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 6 (OVERLAPS) 227/423 variables, 196/217 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 7/224 constraints. Problems are: Problem set: 119 solved, 107 unsolved
[2024-05-22 11:18:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:18:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/226 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/226 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/226 constraints. Problems are: Problem set: 119 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 226 constraints, problems are : Problem set: 119 solved, 107 unsolved in 8858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 196/196 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 119 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 13/126 variables, 2/2 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 4/6 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 52/178 variables, 17/23 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/23 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 227/405 variables, 178/201 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 7/208 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 107/315 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/315 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 18/423 variables, 18/333 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/333 constraints. Problems are: Problem set: 119 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/423 variables, 0/333 constraints. Problems are: Problem set: 119 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 333 constraints, problems are : Problem set: 119 solved, 107 unsolved in 9317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 196/196 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 107/226 constraints, Known Traps: 4/4 constraints]
After SMT, in 18213ms problems are : Problem set: 119 solved, 107 unsolved
Search for dead transitions found 119 dead transitions in 18217ms
Found 119 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 119 transitions
Dead transitions reduction (with SMT) removed 119 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 196/209 places, 108/197 transitions.
Graph (complete) has 320 edges and 196 vertex of which 114 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.1 ms
Discarding 82 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 114 /196 variables (removed 82) and now considering 108/108 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/209 places, 108/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18277 ms. Remains : 114/209 places, 108/197 transitions.
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:18:55] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 11:18:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 11:18:55] [INFO ] Invariant cache hit.
[2024-05-22 11:18:55] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:18:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:18:58] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:19:00] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:19:00] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:19:00] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 3 ms to minimize.
[2024-05-22 11:19:00] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:19:01] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:19:01] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:19:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:19:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:19:03] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:19:03] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:19:03] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:19:04] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 17276 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:19:22] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:19:33] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 47318ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47322ms
Finished structural reductions in LTL mode , in 1 iterations and 47683 ms. Remains : 209/209 places, 197/197 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-00 finished in 224885 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 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 99 place count 158 transition count 139
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 201 place count 107 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 99
Applied a total of 202 rules in 12 ms. Remains 106 /209 variables (removed 103) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 106 cols
[2024-05-22 11:19:42] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:19:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:19:42] [INFO ] Invariant cache hit.
[2024-05-22 11:19:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:19:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-22 11:19:43] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:19:43] [INFO ] Invariant cache hit.
[2024-05-22 11:19:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:19:44] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 95/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:19:50] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:19:51] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 232 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 12146ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12385 ms. Remains : 106/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-01 finished in 12458 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||G(p0)))||(p2&&F(p3))))))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 159 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 187 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 199 place count 108 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 107 transition count 101
Applied a total of 200 rules in 16 ms. Remains 107 /209 variables (removed 102) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-22 11:19:55] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 11:19:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 11:19:55] [INFO ] Invariant cache hit.
[2024-05-22 11:19:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:19:55] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-22 11:19:55] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:19:55] [INFO ] Invariant cache hit.
[2024-05-22 11:19:55] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:19:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:19:57] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/207 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:20:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:20:04] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 4/4 constraints]
After SMT, in 13029ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 13030ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/209 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13276 ms. Remains : 107/209 places, 101/197 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-02
Product exploration explored 100000 steps with 12191 reset in 146 ms.
Product exploration explored 100000 steps with 12258 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 321 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 231 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (4942 resets) in 136 ms. (291 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40000 steps (2993 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3017 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2985 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2993 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3066 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2982 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
[2024-05-22 11:20:09] [INFO ] Invariant cache hit.
[2024-05-22 11:20:09] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 29/83 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 91/174 variables, 83/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 28/202 variables, 19/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/204 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 15 (OVERLAPS) 4/208 variables, 3/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 1/132 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/208 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 132 constraints, problems are : Problem set: 2 solved, 4 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/83 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 91/174 variables, 83/98 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 4/102 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 4/106 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 11:20:10] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 28/202 variables, 19/126 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/128 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/204 variables, 2/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/208 variables, 3/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 1/137 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/208 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/208 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 137 constraints, problems are : Problem set: 2 solved, 4 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 695 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 305 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 100
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 106 transition count 87
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 93 transition count 87
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 93 transition count 87
Applied a total of 42 rules in 6 ms. Remains 93 /107 variables (removed 14) and now considering 87/101 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/107 places, 87/101 transitions.
RANDOM walk for 40000 steps (5050 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3307 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3363 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3303 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3318 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2061 steps, run visited all 4 properties in 27 ms. (steps per millisecond=76 )
Probabilistic random walk after 2061 steps, saw 1061 distinct states, run finished after 31 ms. (steps per millisecond=66 ) properties seen :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p1 (NOT p2) p3)), (G (OR p0 p1 (NOT p2) p3))]
False Knowledge obtained : [(F p3), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 357 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 107 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-22 11:20:11] [INFO ] Invariant cache hit.
[2024-05-22 11:20:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 11:20:11] [INFO ] Invariant cache hit.
[2024-05-22 11:20:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:20:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-22 11:20:12] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:20:12] [INFO ] Invariant cache hit.
[2024-05-22 11:20:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:20:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:20:13] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/207 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:20:20] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
[2024-05-22 11:20:20] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 4/4 constraints]
After SMT, in 12794ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12797ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13032 ms. Remains : 107/107 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 321 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4875 resets) in 311 ms. (128 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (2992 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3066 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3055 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-05-22 11:20:25] [INFO ] Invariant cache hit.
[2024-05-22 11:20:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/80 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/83 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:20:25] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 91/174 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 28/202 variables, 19/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/204 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/208 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/208 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/80 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/83 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 91/174 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 28/202 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/204 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/208 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/208 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:20:25] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/208 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 137 constraints, problems are : Problem set: 0 solved, 3 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 363 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 305 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 104 transition count 98
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 19 place count 104 transition count 85
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 32 place count 91 transition count 85
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 46 place count 91 transition count 85
Applied a total of 46 rules in 8 ms. Remains 91 /107 variables (removed 16) and now considering 85/101 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 91/107 places, 85/101 transitions.
RANDOM walk for 40000 steps (5079 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3343 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3416 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3343 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1995 steps, run visited all 3 properties in 14 ms. (steps per millisecond=142 )
Probabilistic random walk after 1995 steps, saw 1028 distinct states, run finished after 14 ms. (steps per millisecond=142 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12206 reset in 85 ms.
Product exploration explored 100000 steps with 12198 reset in 110 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 100
Applied a total of 2 rules in 3 ms. Remains 106 /107 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 106 cols
[2024-05-22 11:20:27] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 11:20:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 11:20:27] [INFO ] Invariant cache hit.
[2024-05-22 11:20:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:20:27] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-22 11:20:27] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:20:27] [INFO ] Invariant cache hit.
[2024-05-22 11:20:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:20:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:20:29] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:20:36] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 235 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 13790ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13791ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/107 places, 100/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14029 ms. Remains : 106/107 places, 100/101 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-02 finished in 46107 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(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:20:41] [INFO ] Computed 19 invariants in 5 ms
[2024-05-22 11:20:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 11:20:41] [INFO ] Invariant cache hit.
[2024-05-22 11:20:41] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:20:44] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:20:44] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:20:47] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:20:47] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:20:47] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:20:47] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:20:47] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:20:48] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:20:48] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:20:48] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:20:49] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:20:49] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:20:49] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:20:51] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:20:52] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16894 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:21:08] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:21:19] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46938ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46942ms
Finished structural reductions in LTL mode , in 1 iterations and 47305 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-03
Entered a terminal (fully accepting) state of product in 455 steps with 15 reset in 2 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-03 finished in 47459 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 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 99 place count 158 transition count 137
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 117 place count 149 transition count 137
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 11 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-22 11:21:28] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:21:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 11:21:28] [INFO ] Invariant cache hit.
[2024-05-22 11:21:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:21:29] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-22 11:21:29] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:21:29] [INFO ] Invariant cache hit.
[2024-05-22 11:21:29] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:21:31] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:21:31] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/204 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3940 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:21:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 98 unsolved in 10618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 14575ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 14577ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14824 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-04 finished in 14882 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)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 97 place count 159 transition count 138
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 12 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-22 11:21:43] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:21:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 11:21:43] [INFO ] Invariant cache hit.
[2024-05-22 11:21:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:21:43] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-22 11:21:43] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:21:43] [INFO ] Invariant cache hit.
[2024-05-22 11:21:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:21:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:21:46] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/204 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:21:51] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 11002ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11255 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-05
Product exploration explored 100000 steps with 13858 reset in 121 ms.
Product exploration explored 100000 steps with 13902 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5545 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3221 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 130 steps, run visited all 1 properties in 15 ms. (steps per millisecond=8 )
Probabilistic random walk after 130 steps, saw 71 distinct states, run finished after 15 ms. (steps per millisecond=8 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 11:21:55] [INFO ] Invariant cache hit.
[2024-05-22 11:21:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 11:21:55] [INFO ] Invariant cache hit.
[2024-05-22 11:21:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:21:56] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-22 11:21:56] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:21:56] [INFO ] Invariant cache hit.
[2024-05-22 11:21:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/204 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:22:03] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 10949ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10951ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11243 ms. Remains : 105/105 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32740 steps (4562 resets) in 53 ms. (606 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13798 reset in 93 ms.
Product exploration explored 100000 steps with 13933 reset in 98 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 11:22:07] [INFO ] Invariant cache hit.
[2024-05-22 11:22:07] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:22:07] [INFO ] Invariant cache hit.
[2024-05-22 11:22:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:22:08] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-22 11:22:08] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:22:08] [INFO ] Invariant cache hit.
[2024-05-22 11:22:08] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:22:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:22:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/204 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:22:15] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 10738ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10739ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10986 ms. Remains : 105/105 places, 99/99 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-05 finished in 35094 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)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 189 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 107 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 100
Applied a total of 202 rules in 9 ms. Remains 106 /209 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 106 cols
[2024-05-22 11:22:18] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:22:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 11:22:18] [INFO ] Invariant cache hit.
[2024-05-22 11:22:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:22:19] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-22 11:22:19] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:22:19] [INFO ] Invariant cache hit.
[2024-05-22 11:22:19] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 131 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 230 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 8729ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8976 ms. Remains : 106/209 places, 100/197 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-06
Product exploration explored 100000 steps with 9714 reset in 89 ms.
Product exploration explored 100000 steps with 9717 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-22 11:22:28] [INFO ] Invariant cache hit.
[2024-05-22 11:22:28] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:22:28] [INFO ] Invariant cache hit.
[2024-05-22 11:22:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:22:28] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-22 11:22:28] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:22:28] [INFO ] Invariant cache hit.
[2024-05-22 11:22:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 131 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 230 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 8650ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8651ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8892 ms. Remains : 106/106 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9752 reset in 127 ms.
Product exploration explored 100000 steps with 9703 reset in 150 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-22 11:22:37] [INFO ] Invariant cache hit.
[2024-05-22 11:22:38] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 11:22:38] [INFO ] Invariant cache hit.
[2024-05-22 11:22:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:22:38] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-22 11:22:38] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:22:38] [INFO ] Invariant cache hit.
[2024-05-22 11:22:38] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 131 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 230 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6525 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 8930ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8931ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9217 ms. Remains : 106/106 places, 100/100 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-06 finished in 28392 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||G(F(p1))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 149
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 161 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 95 place count 160 transition count 140
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 189 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 201 place count 107 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 106 transition count 100
Applied a total of 202 rules in 9 ms. Remains 106 /209 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 106 cols
[2024-05-22 11:22:47] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:22:47] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 11:22:47] [INFO ] Invariant cache hit.
[2024-05-22 11:22:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:22:47] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-22 11:22:47] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:22:47] [INFO ] Invariant cache hit.
[2024-05-22 11:22:47] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:22:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:22:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:22:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:22:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 4/4 constraints]
After SMT, in 9644ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 9645ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9888 ms. Remains : 106/209 places, 100/197 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-07
Product exploration explored 100000 steps with 13837 reset in 98 ms.
Product exploration explored 100000 steps with 13963 reset in 92 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5583 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3276 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3289 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3258 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5534 steps, run visited all 3 properties in 46 ms. (steps per millisecond=120 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 46 ms. (steps per millisecond=120 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-22 11:22:58] [INFO ] Invariant cache hit.
[2024-05-22 11:22:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 11:22:58] [INFO ] Invariant cache hit.
[2024-05-22 11:22:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:22:58] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-22 11:22:58] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:22:58] [INFO ] Invariant cache hit.
[2024-05-22 11:22:58] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:23:00] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:23:00] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:23:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:23:05] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6110 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 4/4 constraints]
After SMT, in 9613ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 9614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9860 ms. Remains : 106/106 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5515 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3304 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3255 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3297 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5534 steps, run visited all 3 properties in 43 ms. (steps per millisecond=128 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 43 ms. (steps per millisecond=128 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13910 reset in 92 ms.
Product exploration explored 100000 steps with 13965 reset in 99 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-22 11:23:09] [INFO ] Invariant cache hit.
[2024-05-22 11:23:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:23:09] [INFO ] Invariant cache hit.
[2024-05-22 11:23:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:23:09] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-22 11:23:09] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 11:23:09] [INFO ] Invariant cache hit.
[2024-05-22 11:23:09] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:23:11] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:23:11] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/205 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 96/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 11:23:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:23:16] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 4/4 constraints]
After SMT, in 9564ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 9566ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9797 ms. Remains : 106/106 places, 100/100 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-07 finished in 31851 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)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 145
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 157 transition count 145
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 101 place count 157 transition count 138
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 201 place count 107 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 99
Applied a total of 202 rules in 9 ms. Remains 106 /209 variables (removed 103) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 106 cols
[2024-05-22 11:23:19] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:23:19] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 11:23:19] [INFO ] Invariant cache hit.
[2024-05-22 11:23:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:23:19] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-22 11:23:19] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:23:19] [INFO ] Invariant cache hit.
[2024-05-22 11:23:19] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:23:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 95/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 230 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
After SMT, in 11158ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11574 ms. Remains : 106/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-08
Product exploration explored 100000 steps with 13924 reset in 82 ms.
Product exploration explored 100000 steps with 13915 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5582 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3258 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 11 ms. (steps per millisecond=287 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 11 ms. (steps per millisecond=287 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 11:23:31] [INFO ] Invariant cache hit.
[2024-05-22 11:23:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 11:23:31] [INFO ] Invariant cache hit.
[2024-05-22 11:23:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:23:31] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-22 11:23:31] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:23:31] [INFO ] Invariant cache hit.
[2024-05-22 11:23:31] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:23:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 95/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 230 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
After SMT, in 11251ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11523 ms. Remains : 106/106 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5517 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3233 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 10 ms. (steps per millisecond=316 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 11 ms. (steps per millisecond=287 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13851 reset in 85 ms.
Product exploration explored 100000 steps with 13817 reset in 88 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 11:23:43] [INFO ] Invariant cache hit.
[2024-05-22 11:23:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 11:23:43] [INFO ] Invariant cache hit.
[2024-05-22 11:23:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:23:43] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-22 11:23:43] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 11:23:43] [INFO ] Invariant cache hit.
[2024-05-22 11:23:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-22 11:23:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/204 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 95/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 230 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints]
After SMT, in 11314ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11578 ms. Remains : 106/106 places, 99/99 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-08 finished in 35832 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(G((p0||X(F(p1))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:23:54] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:23:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 11:23:55] [INFO ] Invariant cache hit.
[2024-05-22 11:23:55] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:23:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:23:58] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:23:58] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:24:00] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:24:00] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:24:00] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2024-05-22 11:24:00] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:24:01] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:24:01] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:24:01] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:24:02] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:24:02] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:24:03] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:24:03] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:24:04] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:24:05] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:24:20] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:24:30] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46492ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46496ms
Finished structural reductions in LTL mode , in 1 iterations and 46949 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09
Product exploration explored 100000 steps with 24964 reset in 79 ms.
Product exploration explored 100000 steps with 25004 reset in 82 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (1309 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1141 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 274895 steps, run visited all 2 properties in 1061 ms. (steps per millisecond=259 )
Probabilistic random walk after 274895 steps, saw 137480 distinct states, run finished after 1062 ms. (steps per millisecond=258 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 300 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 95 place count 160 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 153 transition count 141
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 187 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 197 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 108 transition count 101
Applied a total of 198 rules in 13 ms. Remains 108 /209 variables (removed 101) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 108 cols
[2024-05-22 11:24:43] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:24:44] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 11:24:44] [INFO ] Invariant cache hit.
[2024-05-22 11:24:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:24:44] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-22 11:24:44] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:24:44] [INFO ] Invariant cache hit.
[2024-05-22 11:24:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/209 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:24:45] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:24:46] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 135 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:24:52] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7939 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints]
After SMT, in 11564ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/209 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11918 ms. Remains : 108/209 places, 101/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (5524 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3266 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3283 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 135027 steps, run visited all 2 properties in 395 ms. (steps per millisecond=341 )
Probabilistic random walk after 135027 steps, saw 67543 distinct states, run finished after 395 ms. (steps per millisecond=341 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 34170 reset in 83 ms.
Product exploration explored 100000 steps with 34068 reset in 87 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-22 11:24:57] [INFO ] Invariant cache hit.
[2024-05-22 11:24:57] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 11:24:57] [INFO ] Invariant cache hit.
[2024-05-22 11:24:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:24:57] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 11:24:57] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:24:57] [INFO ] Invariant cache hit.
[2024-05-22 11:24:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/209 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:24:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:24:59] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 135 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:25:05] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7960 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints]
After SMT, in 11538ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11864 ms. Remains : 108/108 places, 101/101 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 74045 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((p0&&F(p1)))||X(p2)))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:25:08] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:25:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 11:25:09] [INFO ] Invariant cache hit.
[2024-05-22 11:25:09] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:25:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:25:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 6 ms to minimize.
[2024-05-22 11:25:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:25:14] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:25:14] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:25:14] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:25:14] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:25:14] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:25:15] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:25:15] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:25:16] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:25:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:25:17] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:25:17] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:25:18] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:25:19] [INFO ] Deduced a trap composed of 55 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16682 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:25:35] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:25:46] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46734ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46737ms
Finished structural reductions in LTL mode , in 1 iterations and 47120 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-10 finished in 47346 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)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 193 place count 111 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 205 place count 105 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 104 transition count 98
Applied a total of 206 rules in 16 ms. Remains 104 /209 variables (removed 105) and now considering 98/197 (removed 99) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-22 11:25:56] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:25:56] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-22 11:25:56] [INFO ] Invariant cache hit.
[2024-05-22 11:25:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:25:56] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-22 11:25:56] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 11:25:56] [INFO ] Invariant cache hit.
[2024-05-22 11:25:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/201 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/202 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 129 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/201 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 94/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/202 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 11:26:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:26:03] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 228 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10031ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10032ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/209 places, 98/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10507 ms. Remains : 104/209 places, 98/197 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-11
Product exploration explored 100000 steps with 13811 reset in 82 ms.
Product exploration explored 100000 steps with 13966 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5523 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3288 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Probably explored full state space saw : 439712 states, properties seen :0
Probabilistic random walk after 879439 steps, saw 439712 distinct states, run finished after 2413 ms. (steps per millisecond=364 ) properties seen :0
Interrupted probabilistic random walk after 857678 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 1
Exhaustive walk after 857678 steps, saw 428974 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2024-05-22 11:26:12] [INFO ] Invariant cache hit.
[2024-05-22 11:26:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/60 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/92 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/126 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/129 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:12] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/194 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/202 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/202 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/202 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/202 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/60 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/92 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 34/126 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/129 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/194 variables, 70/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/202 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/202 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Graph (complete) has 302 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 103 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 90 transition count 84
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 43 place count 90 transition count 84
Applied a total of 43 rules in 6 ms. Remains 90 /104 variables (removed 14) and now considering 84/98 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/104 places, 84/98 transitions.
RANDOM walk for 40000 steps (5105 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3341 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Probably explored full state space saw : 480715 states, properties seen :0
Probabilistic random walk after 961443 steps, saw 480715 distinct states, run finished after 2704 ms. (steps per millisecond=355 ) properties seen :0
Interrupted probabilistic random walk after 1154466 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :0 out of 1
Exhaustive walk after 1154466 steps, saw 577535 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :0
// Phase 1: matrix 84 rows 90 cols
[2024-05-22 11:26:18] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:26:18] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/78 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:18] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:26:18] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:26:18] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 0 ms to minimize.
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/85 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 84/169 variables, 85/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/174 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/78 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/85 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:26:19] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/169 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/174 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/174 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 90/90 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:26:20] [INFO ] Invariant cache hit.
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants in 208 ms returned [21, 27, 58, 63, 81, 87]
[2024-05-22 11:26:20] [INFO ] Actually due to overlaps returned [63, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 223 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 88/90 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 83
Applied a total of 2 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 87 cols
[2024-05-22 11:26:20] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants in 245 ms returned [21, 27, 78, 84]
[2024-05-22 11:26:20] [INFO ] Actually due to overlaps returned [84, 78]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 261 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/90 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 82
Applied a total of 2 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 84 cols
[2024-05-22 11:26:20] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants in 63 ms returned [21, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/90 places, 82/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 11:26:20] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 11:26:20] [INFO ] Invariant cache hit.
[2024-05-22 11:26:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:26:20] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 81/90 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 898 ms. Remains : 81/90 places, 81/84 transitions.
RANDOM walk for 40000 steps (5694 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3640 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1175766 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :0 out of 1
Probabilistic random walk after 1175766 steps, saw 587880 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
[2024-05-22 11:26:24] [INFO ] Invariant cache hit.
[2024-05-22 11:26:24] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:26:24] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:26:24] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:26:24] [INFO ] Invariant cache hit.
[2024-05-22 11:26:24] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:26:24] [INFO ] Invariant cache hit.
[2024-05-22 11:26:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:26:24] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-22 11:26:24] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:26:24] [INFO ] Invariant cache hit.
[2024-05-22 11:26:24] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-22 11:26:25] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:26:28] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:26:28] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:26:28] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:26:28] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:26:28] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3558 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 6025ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6026ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6265 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 13 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2024-05-22 11:26:30] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:26:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:26:30] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:26:30] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:26:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:26:30] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:26:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 11:26:30] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:26:30] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:26:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:26:30] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:26:30] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:26:30] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:26:30] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:26:30] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:26:30] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:26:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
TRAPS : Iteration 1
[2024-05-22 11:26:30] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:26:30] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-22 11:26:31] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:26:31] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-22 11:26:31] [INFO ] Invariant cache hit.
[2024-05-22 11:26:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:26:31] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-05-22 11:26:31] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 11:26:31] [INFO ] Invariant cache hit.
[2024-05-22 11:26:31] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/201 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/202 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 129 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/201 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 94/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/202 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 11:26:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:26:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 228 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7635 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10164ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10166ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10669 ms. Remains : 104/104 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5526 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3259 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Probably explored full state space saw : 439712 states, properties seen :0
Probabilistic random walk after 879439 steps, saw 439712 distinct states, run finished after 2349 ms. (steps per millisecond=374 ) properties seen :0
Interrupted probabilistic random walk after 1115126 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 1
Exhaustive walk after 1115126 steps, saw 557567 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
[2024-05-22 11:26:47] [INFO ] Invariant cache hit.
[2024-05-22 11:26:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/60 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/92 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/126 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/129 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:47] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/194 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/202 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/202 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/202 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/202 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/60 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/92 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 34/126 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/129 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/194 variables, 70/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/202 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/202 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Graph (complete) has 302 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 103 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 90 transition count 84
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 43 place count 90 transition count 84
Applied a total of 43 rules in 4 ms. Remains 90 /104 variables (removed 14) and now considering 84/98 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/104 places, 84/98 transitions.
RANDOM walk for 40000 steps (5049 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3307 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Probably explored full state space saw : 480715 states, properties seen :0
Probabilistic random walk after 961443 steps, saw 480715 distinct states, run finished after 2546 ms. (steps per millisecond=377 ) properties seen :0
Interrupted probabilistic random walk after 1186603 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 1
Exhaustive walk after 1186603 steps, saw 593542 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
// Phase 1: matrix 84 rows 90 cols
[2024-05-22 11:26:53] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:26:53] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/78 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/85 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 84/169 variables, 85/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/174 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/78 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/85 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:53] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:26:54] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/169 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/174 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/174 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:26:54] [INFO ] Invariant cache hit.
[2024-05-22 11:26:54] [INFO ] Implicit Places using invariants in 90 ms returned [21, 27, 58, 63, 81, 87]
[2024-05-22 11:26:54] [INFO ] Actually due to overlaps returned [63, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 88/90 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 83
Applied a total of 2 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 87 cols
[2024-05-22 11:26:54] [INFO ] Computed 17 invariants in 2 ms
[2024-05-22 11:26:54] [INFO ] Implicit Places using invariants in 75 ms returned [21, 27, 78, 84]
[2024-05-22 11:26:54] [INFO ] Actually due to overlaps returned [84, 78]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/90 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 82
Applied a total of 2 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 84 cols
[2024-05-22 11:26:54] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:26:54] [INFO ] Implicit Places using invariants in 59 ms returned [21, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/90 places, 82/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 11:26:54] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:26:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 11:26:54] [INFO ] Invariant cache hit.
[2024-05-22 11:26:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:26:54] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 81/90 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 568 ms. Remains : 81/90 places, 81/84 transitions.
RANDOM walk for 40000 steps (5741 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3592 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1243798 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 1
Probabilistic random walk after 1243798 steps, saw 621894 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-05-22 11:26:57] [INFO ] Invariant cache hit.
[2024-05-22 11:26:57] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:26:57] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 11:26:57] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:26:57] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:26:58] [INFO ] Invariant cache hit.
[2024-05-22 11:26:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:26:58] [INFO ] Invariant cache hit.
[2024-05-22 11:26:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:26:58] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-22 11:26:58] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:26:58] [INFO ] Invariant cache hit.
[2024-05-22 11:26:58] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:26:58] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:26:58] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:26:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:26:59] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:26:59] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:26:59] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:26:59] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:27:01] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:27:01] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:27:02] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:27:02] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:27:02] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3625 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 6051ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6288 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 3 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2024-05-22 11:27:04] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:27:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:27:04] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:27:04] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:27:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:27:04] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:27:04] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 11:27:04] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:27:04] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:27:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-22 11:27:04] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:27:04] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:27:04] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:27:04] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:27:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-22 11:27:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:27:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
TRAPS : Iteration 1
[2024-05-22 11:27:04] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:27:04] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 361 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14010 reset in 124 ms.
Product exploration explored 100000 steps with 13948 reset in 90 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-22 11:27:05] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 11:27:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 11:27:05] [INFO ] Invariant cache hit.
[2024-05-22 11:27:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:27:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-22 11:27:05] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 11:27:05] [INFO ] Invariant cache hit.
[2024-05-22 11:27:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/201 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/202 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 129 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/201 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 94/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/202 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 11:27:11] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:27:12] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 228 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7553 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10121ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10358 ms. Remains : 104/104 places, 98/98 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-11 finished in 79222 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((G(p0)||(p0&&F(p1)))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:27:15] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:27:15] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 11:27:15] [INFO ] Invariant cache hit.
[2024-05-22 11:27:15] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:27:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:27:18] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:27:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:27:21] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:27:21] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:27:21] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:27:21] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:27:21] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:27:21] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:27:22] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:27:22] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2024-05-22 11:27:25] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:27:26] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:27:42] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:27:52] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 47031ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47033ms
Finished structural reductions in LTL mode , in 1 iterations and 47399 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 52 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-12 finished in 47853 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(G(p0)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 11:28:03] [INFO ] Invariant cache hit.
[2024-05-22 11:28:03] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 11:28:03] [INFO ] Invariant cache hit.
[2024-05-22 11:28:03] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:28:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:28:06] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:28:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:28:08] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-22 11:28:08] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:28:09] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:28:09] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:28:09] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:28:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:28:09] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:28:10] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:28:11] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:28:11] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:28:11] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:28:12] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:28:14] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:28:30] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:28:40] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46912ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46914ms
Finished structural reductions in LTL mode , in 1 iterations and 47359 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-13 finished in 47476 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(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 208 transition count 146
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 101 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 150 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 189 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 108 transition count 102
Applied a total of 201 rules in 15 ms. Remains 108 /209 variables (removed 101) and now considering 102/197 (removed 95) transitions.
// Phase 1: matrix 102 rows 108 cols
[2024-05-22 11:28:50] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 11:28:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 11:28:50] [INFO ] Invariant cache hit.
[2024-05-22 11:28:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 11:28:51] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-22 11:28:51] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-22 11:28:51] [INFO ] Invariant cache hit.
[2024-05-22 11:28:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/210 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 11:28:52] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:28:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:28:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:28:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:28:53] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:28:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/210 variables, 108/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 11:28:56] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 243 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 7/7 constraints]
After SMT, in 9461ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9746 ms. Remains : 108/209 places, 102/197 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-14
Product exploration explored 100000 steps with 8893 reset in 78 ms.
Product exploration explored 100000 steps with 8841 reset in 87 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/108 stabilizing places and 1/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 163 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3525 resets) in 45 ms. (869 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (2445 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-22 11:29:01] [INFO ] Invariant cache hit.
[2024-05-22 11:29:01] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/94 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/129 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/133 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/137 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/206 variables, 76/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/210 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/94 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 35/129 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/133 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 69/206 variables, 76/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/210 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:29:01] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:29:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 7 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/108 places, 85/102 transitions.
RANDOM walk for 40000 steps (5156 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 9 ms. (steps per millisecond=216 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 9 ms. (steps per millisecond=216 ) properties seen :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-22 11:29:02] [INFO ] Invariant cache hit.
[2024-05-22 11:29:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:29:02] [INFO ] Invariant cache hit.
[2024-05-22 11:29:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 11:29:02] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-22 11:29:02] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-22 11:29:02] [INFO ] Invariant cache hit.
[2024-05-22 11:29:02] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/210 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 11:29:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:29:04] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:29:04] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:29:04] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:29:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:29:05] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/210 variables, 108/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 11:29:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 243 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5375 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 7/7 constraints]
After SMT, in 9629ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9921 ms. Remains : 108/108 places, 102/102 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3494 resets) in 52 ms. (754 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (2452 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-22 11:29:12] [INFO ] Invariant cache hit.
[2024-05-22 11:29:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/94 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/129 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/133 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/137 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/206 variables, 76/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/210 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/62 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/94 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 35/129 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/133 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 69/206 variables, 76/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/210 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:29:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 6 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 91/108 places, 85/102 transitions.
RANDOM walk for 40000 steps (5126 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3449 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 8 ms. (steps per millisecond=243 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 8 ms. (steps per millisecond=243 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8890 reset in 84 ms.
Product exploration explored 100000 steps with 8850 reset in 89 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /108 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-22 11:29:13] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 11:29:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 11:29:13] [INFO ] Invariant cache hit.
[2024-05-22 11:29:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:29:13] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-22 11:29:13] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:29:13] [INFO ] Invariant cache hit.
[2024-05-22 11:29:13] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/207 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 97/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/208 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 233 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/107 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 12244ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12246ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12517 ms. Remains : 107/108 places, 101/102 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-14 finished in 34979 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(!p0)||X(X(F((!p0&&F(p1)))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:29:25] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:29:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 11:29:25] [INFO ] Invariant cache hit.
[2024-05-22 11:29:26] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 11:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:29:29] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:31] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:29:32] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-22 11:29:33] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:29:34] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:29:35] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:29:36] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16909 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:29:52] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 11:30:02] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46973ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46976ms
Finished structural reductions in LTL mode , in 1 iterations and 47351 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-15
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-15 finished in 47644 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((G(p0)||(p1 U X(p2)))))'
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||G(p0)))||(p2&&F(p3))))))'
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)))'
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)))'
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||G(F(p1))))))'
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)))'
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(G((p0||X(F(p1))))))'
Found a Lengthening insensitive property : DoubleExponent-PT-004-LTLFireability-09
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 95 place count 160 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 153 transition count 141
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 187 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 197 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 108 transition count 101
Applied a total of 198 rules in 21 ms. Remains 108 /209 variables (removed 101) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 108 cols
[2024-05-22 11:30:14] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 11:30:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:30:14] [INFO ] Invariant cache hit.
[2024-05-22 11:30:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:30:14] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-22 11:30:14] [INFO ] Invariant cache hit.
[2024-05-22 11:30:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/209 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:30:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 135 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:30:22] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints]
After SMT, in 11377ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11380ms
Starting structural reductions in LI_LTL mode, iteration 1 : 108/209 places, 101/197 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11636 ms. Remains : 108/209 places, 101/197 transitions.
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09
Product exploration explored 100000 steps with 25723 reset in 82 ms.
Product exploration explored 100000 steps with 25809 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (5568 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3251 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3224 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 135027 steps, run visited all 2 properties in 377 ms. (steps per millisecond=358 )
Probabilistic random walk after 135027 steps, saw 67543 distinct states, run finished after 377 ms. (steps per millisecond=358 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-22 11:30:26] [INFO ] Invariant cache hit.
[2024-05-22 11:30:27] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 11:30:27] [INFO ] Invariant cache hit.
[2024-05-22 11:30:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:30:27] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-22 11:30:27] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:30:27] [INFO ] Invariant cache hit.
[2024-05-22 11:30:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/209 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:30:28] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:30:29] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 135 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3629 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:30:35] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7972 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints]
After SMT, in 11622ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11623ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11880 ms. Remains : 108/108 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (5543 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3206 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3233 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 135027 steps, run visited all 2 properties in 386 ms. (steps per millisecond=349 )
Probabilistic random walk after 135027 steps, saw 67543 distinct states, run finished after 386 ms. (steps per millisecond=349 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 34070 reset in 80 ms.
Product exploration explored 100000 steps with 34032 reset in 89 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-22 11:30:40] [INFO ] Invariant cache hit.
[2024-05-22 11:30:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 11:30:40] [INFO ] Invariant cache hit.
[2024-05-22 11:30:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 11:30:40] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-22 11:30:40] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 11:30:40] [INFO ] Invariant cache hit.
[2024-05-22 11:30:40] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/209 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:30:42] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:30:42] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 135 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/208 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 97/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 11:30:48] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 236 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints]
After SMT, in 11812ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12088 ms. Remains : 108/108 places, 101/101 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 38103 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)))'
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(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
[2024-05-22 11:30:52] [INFO ] Flatten gal took : 27 ms
[2024-05-22 11:30:52] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 11:30:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 209 places, 197 transitions and 546 arcs took 3 ms.
Total runtime 944258 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 209
TRANSITIONS: 197
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4413
MODEL NAME: /home/mcc/execution/413/model
209 places, 197 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 4348 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716377651801

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DoubleExponent-PT-004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DoubleExponent-PT-004, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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