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.r377-smll-171683809700084.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 SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716901405155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 13:03:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 13:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:03:28] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2024-05-28 13:03:28] [INFO ] Transformed 1295 places.
[2024-05-28 13:03:28] [INFO ] Transformed 749 transitions.
[2024-05-28 13:03:28] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 564 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 19 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 391
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 391
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 196 transition count 385
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 385 place count 166 transition count 355
Iterating global reduction 2 with 30 rules applied. Total rules applied 415 place count 166 transition count 355
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 432 place count 166 transition count 338
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 448 place count 150 transition count 320
Iterating global reduction 3 with 16 rules applied. Total rules applied 464 place count 150 transition count 320
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 516 place count 150 transition count 268
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 521 place count 145 transition count 260
Iterating global reduction 4 with 5 rules applied. Total rules applied 526 place count 145 transition count 260
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 531 place count 140 transition count 255
Iterating global reduction 4 with 5 rules applied. Total rules applied 536 place count 140 transition count 255
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 538 place count 138 transition count 253
Iterating global reduction 4 with 2 rules applied. Total rules applied 540 place count 138 transition count 253
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 541 place count 137 transition count 252
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 137 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 543 place count 136 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 544 place count 136 transition count 251
Applied a total of 544 rules in 235 ms. Remains 136 /259 variables (removed 123) and now considering 251/749 (removed 498) transitions.
// Phase 1: matrix 251 rows 136 cols
[2024-05-28 13:03:29] [INFO ] Computed 5 invariants in 41 ms
[2024-05-28 13:03:29] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-28 13:03:29] [INFO ] Invariant cache hit.
[2024-05-28 13:03:29] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-28 13:03:30] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2024-05-28 13:03:30] [INFO ] Invariant cache hit.
[2024-05-28 13:03:30] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-28 13:03:37] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 22 ms to minimize.
[2024-05-28 13:03:37] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 251/387 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 158/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 301 constraints, problems are : Problem set: 0 solved, 250 unsolved in 23291 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 251/387 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 158/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 250/551 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-28 13:04:04] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:04:04] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 553 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 4/4 constraints]
After SMT, in 54511ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 54546ms
Starting structural reductions in LTL mode, iteration 1 : 136/259 places, 251/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56466 ms. Remains : 136/259 places, 251/749 transitions.
Support contains 23 out of 136 places after structural reductions.
[2024-05-28 13:04:25] [INFO ] Flatten gal took : 81 ms
[2024-05-28 13:04:25] [INFO ] Flatten gal took : 49 ms
[2024-05-28 13:04:25] [INFO ] Input system was already deterministic with 251 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8927 resets) in 3115 ms. (12 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (180 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (172 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (210 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (203 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (204 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (178 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (197 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (430 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (193 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (188 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (202 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (191 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (200 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (192 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (178 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (225 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (182 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (192 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (191 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (186 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (172 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (189 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 241063 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :13 out of 23
Probabilistic random walk after 241063 steps, saw 112859 distinct states, run finished after 3010 ms. (steps per millisecond=80 ) properties seen :13
[2024-05-28 13:04:30] [INFO ] Invariant cache hit.
[2024-05-28 13:04:30] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 58/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 8/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 32/112 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 13:04:30] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 191/303 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 98/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 11 (OVERLAPS) 84/387 variables, 24/240 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 60/300 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 300 constraints, problems are : Problem set: 3 solved, 7 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 60/71 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/79 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 32/111 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 182/293 variables, 111/117 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 89/206 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 94/387 variables, 25/232 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 69/301 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 6/307 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-28 13:04:32] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 1/308 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 308 constraints, problems are : Problem set: 3 solved, 7 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 2825ms problems are : Problem set: 3 solved, 7 unsolved
Parikh walk visited 0 properties in 31379 ms.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 251/251 transitions.
Graph (complete) has 462 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 249
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 126 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 126 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 117 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 117 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 117 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 112 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 112 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 112 transition count 170
Applied a total of 54 rules in 43 ms. Remains 112 /136 variables (removed 24) and now considering 170/251 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 112/136 places, 170/251 transitions.
RANDOM walk for 40000 steps (8994 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1829 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1878 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4169 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1936 resets) in 251 ms. (158 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 396214 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 7
Probabilistic random walk after 396214 steps, saw 172336 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 170 rows 112 cols
[2024-05-28 13:05:08] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 13:05:08] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 51/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 157/234 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 48/282 variables, 35/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 209 constraints, problems are : Problem set: 0 solved, 7 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 51/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 157/234 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 48/282 variables, 35/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 7/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 13:05:09] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/282 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 217 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1847 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2346ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 32614 ms.
Support contains 11 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 170/170 transitions.
Applied a total of 0 rules in 24 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 112/112 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 170/170 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-28 13:05:43] [INFO ] Invariant cache hit.
[2024-05-28 13:05:43] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-28 13:05:43] [INFO ] Invariant cache hit.
[2024-05-28 13:05:43] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-28 13:05:43] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-28 13:05:43] [INFO ] Redundant transitions in 7 ms returned []
Running 169 sub problems to find dead transitions.
[2024-05-28 13:05:43] [INFO ] Invariant cache hit.
[2024-05-28 13:05:43] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/282 variables, 112/116 constraints. Problems are: Problem set: 0 solved, 169 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 209 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/282 variables, 112/116 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 169/378 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 13:05:57] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 379 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 1/1 constraints]
After SMT, in 30975ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 30978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31456 ms. Remains : 112/112 places, 170/170 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 47 stable transitions
Graph (complete) has 514 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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((p0||X(X(X(G(p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 91 transition count 117
Applied a total of 101 rules in 28 ms. Remains 91 /136 variables (removed 45) and now considering 117/251 (removed 134) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:06:15] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:06:15] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-28 13:06:15] [INFO ] Invariant cache hit.
[2024-05-28 13:06:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:06:15] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-28 13:06:15] [INFO ] Invariant cache hit.
[2024-05-28 13:06:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:06:17] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-28 13:06:17] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6818 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 8255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 15279ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 15282ms
Starting structural reductions in LTL mode, iteration 1 : 91/136 places, 117/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15852 ms. Remains : 91/136 places, 117/251 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
Product exploration explored 100000 steps with 22380 reset in 454 ms.
Product exploration explored 100000 steps with 22382 reset in 332 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8919 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1918658 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :0 out of 1
Probabilistic random walk after 1918658 steps, saw 850245 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
[2024-05-28 13:06:35] [INFO ] Invariant cache hit.
[2024-05-28 13:06:35] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 51 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 83/91 places, 96/117 transitions.
RANDOM walk for 40000 steps (8927 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1886 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119915 steps, run visited all 1 properties in 1413 ms. (steps per millisecond=792 )
Probabilistic random walk after 1119915 steps, saw 497329 distinct states, run finished after 1421 ms. (steps per millisecond=788 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 13:06:38] [INFO ] Invariant cache hit.
[2024-05-28 13:06:38] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-28 13:06:38] [INFO ] Invariant cache hit.
[2024-05-28 13:06:38] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:06:39] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-28 13:06:39] [INFO ] Invariant cache hit.
[2024-05-28 13:06:39] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:06:41] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-28 13:06:41] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7349 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 14261ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14264ms
Finished structural reductions in LTL mode , in 1 iterations and 14870 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8959 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2202561 steps, run timeout after 3001 ms. (steps per millisecond=733 ) properties seen :0 out of 1
Probabilistic random walk after 2202561 steps, saw 979108 distinct states, run finished after 3001 ms. (steps per millisecond=733 ) properties seen :0
[2024-05-28 13:06:56] [INFO ] Invariant cache hit.
[2024-05-28 13:06:56] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 34 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 83/91 places, 96/117 transitions.
RANDOM walk for 40000 steps (8939 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119915 steps, run visited all 1 properties in 1486 ms. (steps per millisecond=753 )
Probabilistic random walk after 1119915 steps, saw 497329 distinct states, run finished after 1486 ms. (steps per millisecond=753 ) properties seen :1
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22410 reset in 219 ms.
Product exploration explored 100000 steps with 22388 reset in 286 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 86 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 86 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 85 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 85 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 84 transition count 98
Applied a total of 18 rules in 42 ms. Remains 84 /91 variables (removed 7) and now considering 98/117 (removed 19) transitions.
[2024-05-28 13:07:01] [INFO ] Redundant transitions in 4 ms returned []
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 13:07:01] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 13:07:01] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:07:02] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:07:02] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5586 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 11914ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11916ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/91 places, 98/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11970 ms. Remains : 84/91 places, 98/117 transitions.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 86 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 86 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 85 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 85 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 84 transition count 98
Applied a total of 18 rules in 9 ms. Remains 84 /91 variables (removed 7) and now considering 98/117 (removed 19) transitions.
[2024-05-28 13:07:13] [INFO ] Invariant cache hit.
[2024-05-28 13:07:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 13:07:13] [INFO ] Invariant cache hit.
[2024-05-28 13:07:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:07:13] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 13:07:13] [INFO ] Invariant cache hit.
[2024-05-28 13:07:13] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:07:15] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:07:15] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 11479ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11480ms
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 98/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11804 ms. Remains : 84/91 places, 98/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 finished in 70210 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 49 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 13:07:25] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:07:25] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-28 13:07:25] [INFO ] Invariant cache hit.
[2024-05-28 13:07:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:07:26] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2024-05-28 13:07:26] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:07:26] [INFO ] Invariant cache hit.
[2024-05-28 13:07:26] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:07:27] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 6 ms to minimize.
[2024-05-28 13:07:27] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5528 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 11828ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11830ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12805 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 12859 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(F(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 8 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
[2024-05-28 13:07:38] [INFO ] Invariant cache hit.
[2024-05-28 13:07:38] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 13:07:38] [INFO ] Invariant cache hit.
[2024-05-28 13:07:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:07:38] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 13:07:38] [INFO ] Invariant cache hit.
[2024-05-28 13:07:38] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:07:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:07:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10756ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10757ms
Starting structural reductions in LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11070 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 finished in 11215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 153
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 108 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 98 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 98 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 88 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 11 ms. Remains 87 /136 variables (removed 49) and now considering 102/251 (removed 149) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 13:07:49] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:07:49] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 13:07:49] [INFO ] Invariant cache hit.
[2024-05-28 13:07:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:07:49] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-28 13:07:49] [INFO ] Invariant cache hit.
[2024-05-28 13:07:49] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:07:51] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
[2024-05-28 13:07:51] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:07:53] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 14431ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 14433ms
Starting structural reductions in LTL mode, iteration 1 : 87/136 places, 102/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14853 ms. Remains : 87/136 places, 102/251 transitions.
Stuttering acceptance computed with spot in 339 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Product exploration explored 100000 steps with 22335 reset in 308 ms.
Product exploration explored 100000 steps with 22443 reset in 364 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8939 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 25 ms. (steps per millisecond=99 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 25 ms. (steps per millisecond=99 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 207 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 102 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 13:08:06] [INFO ] Invariant cache hit.
[2024-05-28 13:08:06] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-28 13:08:06] [INFO ] Invariant cache hit.
[2024-05-28 13:08:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:08:06] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-28 13:08:06] [INFO ] Redundant transitions in 4 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 13:08:06] [INFO ] Invariant cache hit.
[2024-05-28 13:08:06] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:08:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-28 13:08:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:08:10] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5746 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 12904ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 12907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13417 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 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 p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8991 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1925 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 17 ms. (steps per millisecond=146 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 17 ms. (steps per millisecond=146 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 250 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 162 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22498 reset in 212 ms.
Product exploration explored 100000 steps with 22363 reset in 234 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 13:08:20] [INFO ] Invariant cache hit.
[2024-05-28 13:08:21] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 13:08:21] [INFO ] Invariant cache hit.
[2024-05-28 13:08:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:08:21] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-28 13:08:21] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 13:08:21] [INFO ] Invariant cache hit.
[2024-05-28 13:08:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:08:22] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:08:22] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:08:24] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 13690ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 13692ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14174 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 45937 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(p1)))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 120 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 120 transition count 142
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 105 transition count 127
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 105 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 105 transition count 120
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 79 place count 95 transition count 110
Iterating global reduction 1 with 10 rules applied. Total rules applied 89 place count 95 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 95 place count 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 93 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 93 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 91 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 90 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 89 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 97
Applied a total of 108 rules in 11 ms. Remains 89 /136 variables (removed 47) and now considering 97/251 (removed 154) transitions.
// Phase 1: matrix 97 rows 89 cols
[2024-05-28 13:08:35] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:08:35] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 13:08:35] [INFO ] Invariant cache hit.
[2024-05-28 13:08:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 13:08:35] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 13:08:35] [INFO ] Invariant cache hit.
[2024-05-28 13:08:35] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 13:08:37] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-28 13:08:37] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/186 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/186 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 96/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 13:08:44] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 232 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8636 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 14564ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14566ms
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 97/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14948 ms. Remains : 89/136 places, 97/251 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 15085 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 U (p1||G(!p0))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 96 transition count 120
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 96 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 96 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 94 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 92 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 91 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 89 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 89 transition count 106
Applied a total of 106 rules in 10 ms. Remains 89 /136 variables (removed 47) and now considering 106/251 (removed 145) transitions.
// Phase 1: matrix 106 rows 89 cols
[2024-05-28 13:08:50] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:08:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 13:08:50] [INFO ] Invariant cache hit.
[2024-05-28 13:08:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 13:08:50] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 13:08:50] [INFO ] Invariant cache hit.
[2024-05-28 13:08:50] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 13:08:52] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:08:52] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/195 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 145 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/195 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 105/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 250 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
After SMT, in 14225ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 14227ms
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 106/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14690 ms. Remains : 89/136 places, 106/251 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, false, false, (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 286 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 15535 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(F((p0||X((F(p0) U p1))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 144
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 144
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 129
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 106 transition count 122
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 96 transition count 112
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 96 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 96 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 94 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 94 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 92 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 92 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 91 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 91 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 90 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 90 transition count 99
Applied a total of 106 rules in 9 ms. Remains 90 /136 variables (removed 46) and now considering 99/251 (removed 152) transitions.
// Phase 1: matrix 99 rows 90 cols
[2024-05-28 13:09:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:09:05] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 13:09:05] [INFO ] Invariant cache hit.
[2024-05-28 13:09:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 13:09:06] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 13:09:06] [INFO ] Invariant cache hit.
[2024-05-28 13:09:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 13:09:07] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-28 13:09:07] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/189 variables, 90/97 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 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/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/189 variables, 90/97 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 98/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 13:09:14] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 237 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 13121ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 13123ms
Starting structural reductions in LTL mode, iteration 1 : 90/136 places, 99/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13485 ms. Remains : 90/136 places, 99/251 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 finished in 13626 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) U X((!p2||(p3 U p1))))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 169
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 169
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 156
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 151
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 101 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 101 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 101 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 99 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 99 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 97 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 96 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 96 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 95 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 94 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 94 transition count 128
Applied a total of 95 rules in 15 ms. Remains 94 /136 variables (removed 42) and now considering 128/251 (removed 123) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 13:09:19] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:09:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 13:09:19] [INFO ] Invariant cache hit.
[2024-05-28 13:09:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 13:09:20] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 13:09:20] [INFO ] Invariant cache hit.
[2024-05-28 13:09:20] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 13:09:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:09:22] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 168 constraints, problems are : Problem set: 0 solved, 127 unsolved in 8714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 127/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 295 constraints, problems are : Problem set: 0 solved, 127 unsolved in 8442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
After SMT, in 17348ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 17351ms
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 128/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17964 ms. Remains : 94/136 places, 128/251 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
Product exploration explored 100000 steps with 41676 reset in 194 ms.
Product exploration explored 100000 steps with 41651 reset in 344 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 192 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8964 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1902 resets) in 315 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1836 resets) in 685 ms. (58 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1913 resets) in 429 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1987 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1980 resets) in 407 ms. (98 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1832 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 387 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1931 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1937 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1945 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 181223 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :7 out of 12
Probabilistic random walk after 181223 steps, saw 83000 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :7
[2024-05-28 13:09:43] [INFO ] Invariant cache hit.
[2024-05-28 13:09:43] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 113/188 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 52/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/222 variables, 19/151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 166 constraints, problems are : Problem set: 1 solved, 4 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/75 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/188 variables, 75/80 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 52/132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/222 variables, 19/151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 4/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 170 constraints, problems are : Problem set: 1 solved, 4 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4078 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 126
Applied a total of 3 rules in 7 ms. Remains 93 /94 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/94 places, 126/128 transitions.
RANDOM walk for 40000 steps (8992 resets) in 471 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1908 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 398 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 183328 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 4
Probabilistic random walk after 183328 steps, saw 83982 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 126 rows 93 cols
[2024-05-28 13:09:52] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 13:09:52] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/174 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/219 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/174 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/219 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 166 constraints, problems are : Problem set: 0 solved, 4 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 995ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2398 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/93 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 13:09:55] [INFO ] Invariant cache hit.
[2024-05-28 13:09:55] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 13:09:55] [INFO ] Invariant cache hit.
[2024-05-28 13:09:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 13:09:56] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-28 13:09:56] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-28 13:09:56] [INFO ] Invariant cache hit.
[2024-05-28 13:09:56] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/219 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 125 unsolved in 6748 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/219 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 125/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 287 constraints, problems are : Problem set: 0 solved, 125 unsolved in 10009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 16952ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 16955ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17550 ms. Remains : 93/93 places, 126/126 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 120
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 107
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 53 place count 67 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 67 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 66 transition count 98
Applied a total of 55 rules in 18 ms. Remains 66 /93 variables (removed 27) and now considering 98/126 (removed 28) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 66 cols
[2024-05-28 13:10:13] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:10:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:10:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 13:10:13] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 13:10:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:10:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:10:13] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 13:10:13] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 13:10:13] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 494 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p3)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 410 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 13:10:14] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:10:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 13:10:14] [INFO ] Invariant cache hit.
[2024-05-28 13:10:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 13:10:14] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 13:10:14] [INFO ] Invariant cache hit.
[2024-05-28 13:10:14] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 13:10:16] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 3 ms to minimize.
[2024-05-28 13:10:16] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 168 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6633 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 127/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 295 constraints, problems are : Problem set: 0 solved, 127 unsolved in 8567 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
After SMT, in 15379ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 15381ms
Finished structural reductions in LTL mode , in 1 iterations and 15821 ms. Remains : 94/94 places, 128/128 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 141 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (9067 resets) in 693 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1855 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1943 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1950 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 382757 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :3 out of 6
Probabilistic random walk after 382757 steps, saw 175694 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :3
[2024-05-28 13:10:34] [INFO ] Invariant cache hit.
[2024-05-28 13:10:34] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/178 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/178 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 13016 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 92 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 88 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 87 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 87 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 86 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 86 transition count 106
Applied a total of 22 rules in 17 ms. Remains 86 /94 variables (removed 8) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 86/94 places, 106/128 transitions.
RANDOM walk for 40000 steps (8950 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2011 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1944 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 414857 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 3
Probabilistic random walk after 414857 steps, saw 187325 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 106 rows 86 cols
[2024-05-28 13:10:51] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 13:10:51] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/153 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/192 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/153 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/192 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4693 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-05-28 13:10:57] [INFO ] Invariant cache hit.
[2024-05-28 13:10:57] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 13:10:57] [INFO ] Invariant cache hit.
[2024-05-28 13:10:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 13:10:57] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-28 13:10:57] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-28 13:10:57] [INFO ] Invariant cache hit.
[2024-05-28 13:10:57] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/192 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/192 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 105/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 11293ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 11296ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11706 ms. Remains : 86/86 places, 106/106 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 100
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 81 transition count 86
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 67 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 49 place count 62 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 61 transition count 80
Applied a total of 51 rules in 11 ms. Remains 61 /86 variables (removed 25) and now considering 80/106 (removed 26) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 80 rows 61 cols
[2024-05-28 13:11:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:11:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 13:11:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 13:11:08] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 13:11:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 13:11:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 13:11:09] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 13:11:09] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 13:11:09] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 339 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 265 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 41597 reset in 293 ms.
Product exploration explored 100000 steps with 41644 reset in 310 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 108
Applied a total of 19 rules in 19 ms. Remains 87 /94 variables (removed 7) and now considering 108/128 (removed 20) transitions.
[2024-05-28 13:11:11] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 87 cols
[2024-05-28 13:11:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:11:11] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 13:11:13] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:11:13] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6880 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 15230ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 15234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/94 places, 108/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15261 ms. Remains : 87/94 places, 108/128 transitions.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 108
Applied a total of 19 rules in 15 ms. Remains 87 /94 variables (removed 7) and now considering 108/128 (removed 20) transitions.
[2024-05-28 13:11:26] [INFO ] Invariant cache hit.
[2024-05-28 13:11:26] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 13:11:26] [INFO ] Invariant cache hit.
[2024-05-28 13:11:26] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-28 13:11:27] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 13:11:27] [INFO ] Invariant cache hit.
[2024-05-28 13:11:27] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 13:11:29] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:11:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 15375ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 15378ms
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 108/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15935 ms. Remains : 87/94 places, 108/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 143160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 24 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 13:11:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:11:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 13:11:42] [INFO ] Invariant cache hit.
[2024-05-28 13:11:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:11:43] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-28 13:11:43] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:11:43] [INFO ] Invariant cache hit.
[2024-05-28 13:11:43] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:11:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:11:44] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10512ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10514ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10970 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 35 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
Product exploration explored 100000 steps with 22307 reset in 119 ms.
Product exploration explored 100000 steps with 22424 reset in 305 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
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 48 ms :[false]
RANDOM walk for 40000 steps (8946 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 74 ms. (steps per millisecond=488 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 75 ms. (steps per millisecond=481 ) properties seen :1
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 43 ms :[false]
Stuttering acceptance computed with spot in 43 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 13:11:54] [INFO ] Invariant cache hit.
[2024-05-28 13:11:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 13:11:54] [INFO ] Invariant cache hit.
[2024-05-28 13:11:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:11:54] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-28 13:11:54] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:11:54] [INFO ] Invariant cache hit.
[2024-05-28 13:11:54] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:11:56] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-28 13:11:56] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10831ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10832ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11233 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 48 ms :[false]
RANDOM walk for 40000 steps (8999 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 78 ms. (steps per millisecond=463 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 79 ms. (steps per millisecond=457 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 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 48 ms :[false]
Stuttering acceptance computed with spot in 47 ms :[false]
Stuttering acceptance computed with spot in 47 ms :[false]
Product exploration explored 100000 steps with 22485 reset in 295 ms.
Product exploration explored 100000 steps with 22472 reset in 247 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 13:12:06] [INFO ] Invariant cache hit.
[2024-05-28 13:12:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-28 13:12:07] [INFO ] Invariant cache hit.
[2024-05-28 13:12:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:12:07] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-28 13:12:07] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:12:07] [INFO ] Invariant cache hit.
[2024-05-28 13:12:07] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:12:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:12:08] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5342 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 11949ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11951ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12404 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 36786 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&&((!p2 U (p3||G(!p2)))||p1)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 162
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 149
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 102 transition count 136
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 102 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 102 transition count 132
Applied a total of 77 rules in 16 ms. Remains 102 /136 variables (removed 34) and now considering 132/251 (removed 119) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 13:12:19] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:12:19] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-28 13:12:19] [INFO ] Invariant cache hit.
[2024-05-28 13:12:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 13:12:19] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-28 13:12:19] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 13:12:19] [INFO ] Invariant cache hit.
[2024-05-28 13:12:19] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 13:12:22] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:12:22] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 13:12:26] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 131/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 21358ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 21361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/136 places, 132/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21956 ms. Remains : 102/136 places, 132/251 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
Product exploration explored 100000 steps with 22432 reset in 318 ms.
Product exploration explored 100000 steps with 22250 reset in 346 ms.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 337 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) p2) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (OR (AND p3 p0) (AND p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (OR (AND p3 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 231 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
RANDOM walk for 40000 steps (8875 resets) in 802 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1924 resets) in 297 ms. (134 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1950 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1927 resets) in 315 ms. (126 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1869 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1946 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 422 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 336 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 267 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 301 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1912 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 201549 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :6 out of 10
Probabilistic random walk after 201549 steps, saw 87780 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :6
[2024-05-28 13:12:46] [INFO ] Invariant cache hit.
[2024-05-28 13:12:46] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:12:47] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1088ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 37014 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 132/132 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 130
Applied a total of 3 rules in 7 ms. Remains 101 /102 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 101/102 places, 130/132 transitions.
RANDOM walk for 40000 steps (9073 resets) in 737 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1968 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 177025 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 177025 steps, saw 78528 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 130 rows 101 cols
[2024-05-28 13:13:28] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:13:28] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 168 constraints, problems are : Problem set: 0 solved, 4 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16272 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/101 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 13:13:46] [INFO ] Invariant cache hit.
[2024-05-28 13:13:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 13:13:46] [INFO ] Invariant cache hit.
[2024-05-28 13:13:46] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 13:13:46] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-28 13:13:46] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 13:13:46] [INFO ] Invariant cache hit.
[2024-05-28 13:13:46] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/231 variables, 101/105 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 63/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 13:13:51] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/231 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 169 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9630 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/231 variables, 101/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 63/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 129/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 298 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 19520ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 19522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19920 ms. Remains : 101/101 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 96 transition count 111
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 83 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 72 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 100
Applied a total of 60 rules in 14 ms. Remains 72 /101 variables (removed 29) and now considering 100/130 (removed 30) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 100 rows 72 cols
[2024-05-28 13:14:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:14:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:14:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:14:06] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 13:14:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:14:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:14:06] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 13:14:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 15 ms to minimize.
[2024-05-28 13:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-05-28 13:14:07] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 13:14:07] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 724 ms.
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) p2) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (OR (AND p3 p0) (AND p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (OR (AND p3 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p3))), (F (NOT (OR (NOT p0) p3 p2))), (F p2), (F (NOT (AND p0 (OR p3 (NOT p2))))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 356 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 132/132 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 13:14:07] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:14:07] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 13:14:07] [INFO ] Invariant cache hit.
[2024-05-28 13:14:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 13:14:08] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-28 13:14:08] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 13:14:08] [INFO ] Invariant cache hit.
[2024-05-28 13:14:08] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 13:14:10] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-28 13:14:10] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 13:14:14] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11421 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 131/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 20778ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 20779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21388 ms. Remains : 102/102 places, 132/132 transitions.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 337 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (OR (AND p0 p3) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (AND p0 p3)), (X p0), (X p1), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (OR (AND p0 p3) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 119 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
RANDOM walk for 40000 steps (8970 resets) in 1255 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1956 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1853 resets) in 306 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1972 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1959 resets) in 420 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1951 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 418 ms. (95 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 230735 steps, run timeout after 3004 ms. (steps per millisecond=76 ) properties seen :6 out of 10
Probabilistic random walk after 230735 steps, saw 101067 distinct states, run finished after 3005 ms. (steps per millisecond=76 ) properties seen :6
[2024-05-28 13:14:34] [INFO ] Invariant cache hit.
[2024-05-28 13:14:34] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:14:34] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 37189 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 132/132 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 130
Applied a total of 3 rules in 4 ms. Remains 101 /102 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/102 places, 130/132 transitions.
RANDOM walk for 40000 steps (9035 resets) in 355 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1958 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1939 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1818 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 175495 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 175495 steps, saw 77984 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 130 rows 101 cols
[2024-05-28 13:15:15] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 13:15:15] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 168 constraints, problems are : Problem set: 0 solved, 4 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1431ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14767 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 13:15:32] [INFO ] Invariant cache hit.
[2024-05-28 13:15:32] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 13:15:32] [INFO ] Invariant cache hit.
[2024-05-28 13:15:32] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 13:15:32] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-28 13:15:32] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 13:15:32] [INFO ] Invariant cache hit.
[2024-05-28 13:15:32] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/231 variables, 101/105 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 63/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 13:15:37] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/231 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 169 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/231 variables, 101/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 63/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 129/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 298 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 18747ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 18750ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19253 ms. Remains : 101/101 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 96 transition count 111
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 83 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 72 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 100
Applied a total of 60 rules in 8 ms. Remains 72 /101 variables (removed 29) and now considering 100/130 (removed 30) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 100 rows 72 cols
[2024-05-28 13:15:51] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 13:15:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 13:15:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 13:15:51] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 13:15:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 13:15:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 13:15:51] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 13:15:51] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2024-05-28 13:15:52] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 13:15:52] [INFO ] After 778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1011 ms.
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (OR (AND p0 p3) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (AND p0 p3)), (X p0), (X p1), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (OR (AND p0 p3) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 p3))), (F (NOT (OR (NOT p0) p3 p2))), (F p2), (F (NOT (AND p0 (OR p3 (NOT p2))))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 449 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Product exploration explored 100000 steps with 22486 reset in 385 ms.
Product exploration explored 100000 steps with 22365 reset in 375 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 13:15:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:15:53] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 13:15:54] [INFO ] Invariant cache hit.
[2024-05-28 13:15:54] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 13:15:54] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-28 13:15:54] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 13:15:54] [INFO ] Invariant cache hit.
[2024-05-28 13:15:54] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 13:15:56] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:15:56] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 13:16:00] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 131 unsolved in 10833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 131/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 22155ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 22157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22558 ms. Remains : 102/102 places, 132/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 237122 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&&F(!p1)) U (G((!p0&&F(!p1)))||(!p0&&G(!p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 91 transition count 117
Applied a total of 101 rules in 19 ms. Remains 91 /136 variables (removed 45) and now considering 117/251 (removed 134) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:16:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:16:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 13:16:16] [INFO ] Invariant cache hit.
[2024-05-28 13:16:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:16:16] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-28 13:16:16] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:16:16] [INFO ] Invariant cache hit.
[2024-05-28 13:16:16] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:16:18] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-05-28 13:16:18] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 16556ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 16560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/136 places, 117/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16973 ms. Remains : 91/136 places, 117/251 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
Product exploration explored 100000 steps with 22474 reset in 154 ms.
Product exploration explored 100000 steps with 22352 reset in 221 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 183 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9026 resets) in 659 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1876 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1882 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1910 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1944 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 413520 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :3 out of 6
Probabilistic random walk after 413520 steps, saw 178225 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :3
[2024-05-28 13:16:38] [INFO ] Invariant cache hit.
[2024-05-28 13:16:38] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 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, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 1 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 13:16:38] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/72 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/174 variables, 72/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 43/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 34/208 variables, 19/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 15/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 157 constraints, problems are : Problem set: 1 solved, 2 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 839ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 704 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/91 places, 115/117 transitions.
RANDOM walk for 40000 steps (9007 resets) in 500 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 374746 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 2
Probabilistic random walk after 374746 steps, saw 160914 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 13:16:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:16:43] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/205 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2381 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 13:16:45] [INFO ] Invariant cache hit.
[2024-05-28 13:16:45] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 13:16:45] [INFO ] Invariant cache hit.
[2024-05-28 13:16:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 13:16:46] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-28 13:16:46] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 13:16:46] [INFO ] Invariant cache hit.
[2024-05-28 13:16:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4472 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 114/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 264 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 12146ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 12147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12474 ms. Remains : 90/90 places, 115/115 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 55 place count 63 transition count 87
Applied a total of 55 rules in 12 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 13:16:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:16:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:16:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:16:58] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 13:16:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:16:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:16:58] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 13:16:58] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 13:16:58] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 300 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 292 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 139 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:16:59] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 13:16:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 13:16:59] [INFO ] Invariant cache hit.
[2024-05-28 13:16:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:16:59] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-28 13:16:59] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:16:59] [INFO ] Invariant cache hit.
[2024-05-28 13:16:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:17:01] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:17:01] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 17306ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 17310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17802 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 182 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8949 resets) in 811 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1904 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1934 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1915 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1940 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 347497 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :3 out of 6
Probabilistic random walk after 347497 steps, saw 148704 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :3
[2024-05-28 13:17:21] [INFO ] Invariant cache hit.
[2024-05-28 13:17:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 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, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 1 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 13:17:21] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/72 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/174 variables, 72/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 43/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 34/208 variables, 19/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 15/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 157 constraints, problems are : Problem set: 1 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 797ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 776 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 5 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/91 places, 115/117 transitions.
RANDOM walk for 40000 steps (9026 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1969 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1898 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 443520 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 2
Probabilistic random walk after 443520 steps, saw 191504 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 13:17:26] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 13:17:26] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/205 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1650 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 13:17:28] [INFO ] Invariant cache hit.
[2024-05-28 13:17:28] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 13:17:28] [INFO ] Invariant cache hit.
[2024-05-28 13:17:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 13:17:28] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-28 13:17:28] [INFO ] Redundant transitions in 0 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 13:17:28] [INFO ] Invariant cache hit.
[2024-05-28 13:17:28] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 114/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 264 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 12563ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 12565ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12957 ms. Remains : 90/90 places, 115/115 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 55 place count 63 transition count 87
Applied a total of 55 rules in 7 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 13:17:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:17:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:17:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:17:41] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 13:17:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 13:17:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:17:41] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 13:17:41] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 13:17:41] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 346 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 342 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 206 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 204 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Product exploration explored 100000 steps with 22502 reset in 264 ms.
Product exploration explored 100000 steps with 22364 reset in 273 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:17:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:17:43] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 13:17:43] [INFO ] Invariant cache hit.
[2024-05-28 13:17:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:17:43] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-28 13:17:43] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:17:43] [INFO ] Invariant cache hit.
[2024-05-28 13:17:43] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:17:45] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:17:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 8341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 16161ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 16163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16718 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 103277 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 U !p1)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 92 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 92 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 90 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 112
Applied a total of 108 rules in 12 ms. Remains 89 /136 variables (removed 47) and now considering 112/251 (removed 139) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-28 13:17:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:17:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 13:17:59] [INFO ] Invariant cache hit.
[2024-05-28 13:17:59] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 13:18:00] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-28 13:18:00] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-28 13:18:00] [INFO ] Invariant cache hit.
[2024-05-28 13:18:00] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 13:18:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:18:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/201 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 150 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6990 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/201 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 111/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 13380ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 13382ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 112/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13855 ms. Remains : 89/136 places, 112/251 transitions.
Stuttering acceptance computed with spot in 96 ms :[p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-15
Product exploration explored 100000 steps with 22534 reset in 150 ms.
Product exploration explored 100000 steps with 22176 reset in 265 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 167 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p1, true, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8890 resets) in 1345 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1931 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1884 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 423073 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :2 out of 4
Probabilistic random walk after 423073 steps, saw 182083 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :2
[2024-05-28 13:18:18] [INFO ] Invariant cache hit.
[2024-05-28 13:18:18] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 99/171 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 41/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 30/201 variables, 17/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 13/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/201 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 148 constraints, problems are : Problem set: 1 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/162 variables, 71/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 33/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/201 variables, 18/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 21/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 149 constraints, problems are : Problem set: 1 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1380 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 112/112 transitions.
Graph (complete) has 259 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 85 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 85 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 84 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 83 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 83 transition count 96
Applied a total of 15 rules in 7 ms. Remains 83 /89 variables (removed 6) and now considering 96/112 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/89 places, 96/112 transitions.
RANDOM walk for 40000 steps (9017 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1912 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 122993 steps, run visited all 1 properties in 157 ms. (steps per millisecond=783 )
Probabilistic random walk after 122993 steps, saw 54256 distinct states, run finished after 157 ms. (steps per millisecond=783 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 12 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 finished in 20776 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((p0||X(X(X(G(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' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Stuttering acceptance computed with spot in 255 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 153
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 108 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 98 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 98 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 88 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 23 ms. Remains 87 /136 variables (removed 49) and now considering 102/251 (removed 149) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 13:18:21] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 13:18:21] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 13:18:21] [INFO ] Invariant cache hit.
[2024-05-28 13:18:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:18:21] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-28 13:18:21] [INFO ] Invariant cache hit.
[2024-05-28 13:18:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:18:23] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:18:23] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:18:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6876 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6726 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 13746ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 13748ms
Starting structural reductions in LI_LTL mode, iteration 1 : 87/136 places, 102/251 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14177 ms. Remains : 87/136 places, 102/251 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Product exploration explored 100000 steps with 22285 reset in 115 ms.
Product exploration explored 100000 steps with 22447 reset in 125 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8957 resets) in 506 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 341 ms. (116 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 55 ms. (steps per millisecond=45 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 56 ms. (steps per millisecond=44 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 209 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 98 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 98 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 13:18:36] [INFO ] Invariant cache hit.
[2024-05-28 13:18:36] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-28 13:18:36] [INFO ] Invariant cache hit.
[2024-05-28 13:18:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:18:37] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-28 13:18:37] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 13:18:37] [INFO ] Invariant cache hit.
[2024-05-28 13:18:37] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:18:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:18:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:18:40] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 10491ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10999 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 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 73 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8961 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1922 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1903 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 27 ms. (steps per millisecond=92 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 27 ms. (steps per millisecond=92 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 171 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 70 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22436 reset in 123 ms.
Product exploration explored 100000 steps with 22301 reset in 136 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 13:18:48] [INFO ] Invariant cache hit.
[2024-05-28 13:18:48] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 13:18:48] [INFO ] Invariant cache hit.
[2024-05-28 13:18:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:18:49] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-28 13:18:49] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 13:18:49] [INFO ] Invariant cache hit.
[2024-05-28 13:18:49] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:18:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
[2024-05-28 13:18:50] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 13:18:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4971 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 9922ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10263 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 38346 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) U X((!p2||(p3 U p1))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 169
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 169
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 156
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 151
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 101 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 101 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 101 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 99 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 99 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 97 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 96 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 96 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 95 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 94 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 94 transition count 128
Applied a total of 95 rules in 17 ms. Remains 94 /136 variables (removed 42) and now considering 128/251 (removed 123) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 13:18:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:18:59] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 13:18:59] [INFO ] Invariant cache hit.
[2024-05-28 13:18:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 13:18:59] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 13:18:59] [INFO ] Invariant cache hit.
[2024-05-28 13:18:59] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 13:19:01] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:19:01] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 168 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 127/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 295 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
After SMT, in 12570ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 12572ms
Starting structural reductions in LI_LTL mode, iteration 1 : 94/136 places, 128/251 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12966 ms. Remains : 94/136 places, 128/251 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
Product exploration explored 100000 steps with 41578 reset in 190 ms.
Product exploration explored 100000 steps with 41663 reset in 205 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 145 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (9000 resets) in 861 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1882 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1925 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 363 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1925 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 341 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1961 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 314 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1965 resets) in 294 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1887 resets) in 251 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1916 resets) in 417 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 416 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1903 resets) in 370 ms. (107 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 215947 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :7 out of 12
Probabilistic random walk after 215947 steps, saw 99282 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :7
[2024-05-28 13:19:17] [INFO ] Invariant cache hit.
[2024-05-28 13:19:17] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 113/188 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 52/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/222 variables, 19/151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 166 constraints, problems are : Problem set: 1 solved, 4 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/75 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/188 variables, 75/80 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 52/132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/222 variables, 19/151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 4/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 170 constraints, problems are : Problem set: 1 solved, 4 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2912 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 126
Applied a total of 3 rules in 4 ms. Remains 93 /94 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 93/94 places, 126/128 transitions.
RANDOM walk for 40000 steps (8988 resets) in 335 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1965 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 237630 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 237630 steps, saw 108532 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 126 rows 93 cols
[2024-05-28 13:19:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:19:25] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/174 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/219 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/174 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/219 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 166 constraints, problems are : Problem set: 0 solved, 4 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 776ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1362 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 93/93 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 13:19:27] [INFO ] Invariant cache hit.
[2024-05-28 13:19:27] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 13:19:27] [INFO ] Invariant cache hit.
[2024-05-28 13:19:27] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 13:19:27] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-28 13:19:27] [INFO ] Redundant transitions in 0 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-28 13:19:27] [INFO ] Invariant cache hit.
[2024-05-28 13:19:27] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/219 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/219 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 125/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 287 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 12285ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 12287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12678 ms. Remains : 93/93 places, 126/126 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 120
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 107
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 53 place count 67 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 67 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 66 transition count 98
Applied a total of 55 rules in 9 ms. Remains 66 /93 variables (removed 27) and now considering 98/126 (removed 28) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 66 cols
[2024-05-28 13:19:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:19:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:19:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:19:40] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 13:19:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:19:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 13:19:40] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 13:19:40] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 13:19:40] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 412 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p3)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 340 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 13:19:41] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 13:19:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 13:19:41] [INFO ] Invariant cache hit.
[2024-05-28 13:19:41] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 13:19:41] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 13:19:41] [INFO ] Invariant cache hit.
[2024-05-28 13:19:41] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 13:19:43] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:19:43] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 168 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 127/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 295 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6612 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
After SMT, in 12651ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 12653ms
Finished structural reductions in LTL mode , in 1 iterations and 13014 ms. Remains : 94/94 places, 128/128 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 142 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8975 resets) in 599 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1924 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 349863 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :3 out of 6
Probabilistic random walk after 349863 steps, saw 159975 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :3
[2024-05-28 13:19:58] [INFO ] Invariant cache hit.
[2024-05-28 13:19:58] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/178 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/178 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 10936 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 92 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 88 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 87 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 87 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 86 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 86 transition count 106
Applied a total of 22 rules in 15 ms. Remains 86 /94 variables (removed 8) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 86/94 places, 106/128 transitions.
RANDOM walk for 40000 steps (9042 resets) in 368 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1858 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1880 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 340110 steps, run timeout after 3014 ms. (steps per millisecond=112 ) properties seen :0 out of 3
Probabilistic random walk after 340110 steps, saw 155623 distinct states, run finished after 3015 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 106 rows 86 cols
[2024-05-28 13:20:13] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:20:13] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/153 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/192 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/153 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/192 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3681 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-05-28 13:20:17] [INFO ] Invariant cache hit.
[2024-05-28 13:20:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 13:20:17] [INFO ] Invariant cache hit.
[2024-05-28 13:20:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 13:20:17] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-28 13:20:17] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-28 13:20:17] [INFO ] Invariant cache hit.
[2024-05-28 13:20:17] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/192 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/192 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 105/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 8680ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 8682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9023 ms. Remains : 86/86 places, 106/106 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 100
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 81 transition count 86
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 67 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 49 place count 62 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 61 transition count 80
Applied a total of 51 rules in 9 ms. Remains 61 /86 variables (removed 25) and now considering 80/106 (removed 26) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 80 rows 61 cols
[2024-05-28 13:20:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:20:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 13:20:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 13:20:26] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 13:20:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 13:20:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 13:20:26] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 13:20:26] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 13:20:26] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 336 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 261 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 41619 reset in 178 ms.
Product exploration explored 100000 steps with 41676 reset in 190 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 108
Applied a total of 19 rules in 8 ms. Remains 87 /94 variables (removed 7) and now considering 108/128 (removed 20) transitions.
[2024-05-28 13:20:28] [INFO ] Redundant transitions in 0 ms returned []
Running 107 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 87 cols
[2024-05-28 13:20:28] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 13:20:28] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 13:20:29] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:20:29] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4567 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5702 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 10363ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10364ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/94 places, 108/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10378 ms. Remains : 87/94 places, 108/128 transitions.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 108
Applied a total of 19 rules in 7 ms. Remains 87 /94 variables (removed 7) and now considering 108/128 (removed 20) transitions.
[2024-05-28 13:20:38] [INFO ] Invariant cache hit.
[2024-05-28 13:20:38] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 13:20:38] [INFO ] Invariant cache hit.
[2024-05-28 13:20:38] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-28 13:20:38] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 13:20:38] [INFO ] Invariant cache hit.
[2024-05-28 13:20:38] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 13:20:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:20:40] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 10287ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10289ms
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 108/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10652 ms. Remains : 87/94 places, 108/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 110228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!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&&((!p2 U (p3||G(!p2)))||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' '!(G(F(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(!p0&&G(!p1)))))))'
[2024-05-28 13:20:49] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:20:49] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 13:20:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 251 transitions and 990 arcs took 8 ms.
Total runtime 1042132 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d1m64

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 3147
MODEL NAME: /home/mcc/execution/411/model
136 places, 251 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716903629696

--------------------
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="SieveSingleMsgMbox-PT-d1m64"
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 SieveSingleMsgMbox-PT-d1m64, 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 r377-smll-171683809700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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