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.r532-smll-171683810700092.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 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-d1m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717245749843

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:42:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:42:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:42:32] [INFO ] Load time of PNML (sax parser for PT used): 506 ms
[2024-06-01 12:42:32] [INFO ] Transformed 1295 places.
[2024-06-01 12:42:32] [INFO ] Transformed 749 transitions.
[2024-06-01 12:42:32] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 729 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 1036 places in 42 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 306 place count 193 transition count 388
Iterating global reduction 1 with 49 rules applied. Total rules applied 355 place count 193 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 361 place count 193 transition count 382
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 391 place count 163 transition count 352
Iterating global reduction 2 with 30 rules applied. Total rules applied 421 place count 163 transition count 352
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 428 place count 163 transition count 345
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 447 place count 144 transition count 324
Iterating global reduction 3 with 19 rules applied. Total rules applied 466 place count 144 transition count 324
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 526 place count 144 transition count 264
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 528 place count 142 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 142 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 532 place count 140 transition count 259
Iterating global reduction 4 with 2 rules applied. Total rules applied 534 place count 140 transition count 259
Applied a total of 534 rules in 147 ms. Remains 140 /259 variables (removed 119) and now considering 259/749 (removed 490) transitions.
// Phase 1: matrix 259 rows 140 cols
[2024-06-01 12:42:33] [INFO ] Computed 5 invariants in 38 ms
[2024-06-01 12:42:34] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-01 12:42:34] [INFO ] Invariant cache hit.
[2024-06-01 12:42:34] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-06-01 12:42:35] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-06-01 12:42:35] [INFO ] Invariant cache hit.
[2024-06-01 12:42:35] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 29 ms to minimize.
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 259/399 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 163/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:42:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 255 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 311 constraints, problems are : Problem set: 3 solved, 255 unsolved in 23928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 4/140 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 259/399 variables, 140/148 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 163/311 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 255/566 constraints. Problems are: Problem set: 3 solved, 255 unsolved
[2024-06-01 12:43:11] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 1/567 constraints. Problems are: Problem set: 3 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/567 constraints. Problems are: Problem set: 3 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 567 constraints, problems are : Problem set: 3 solved, 255 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 255/258 constraints, Known Traps: 4/4 constraints]
After SMT, in 55031ms problems are : Problem set: 3 solved, 255 unsolved
Search for dead transitions found 3 dead transitions in 55065ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 140/259 places, 256/749 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 137 transition count 256
Applied a total of 3 rules in 7 ms. Remains 137 /140 variables (removed 3) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 137 cols
[2024-06-01 12:43:30] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 12:43:30] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 12:43:30] [INFO ] Invariant cache hit.
[2024-06-01 12:43:30] [INFO ] State equation strengthened by 162 read => feed constraints.
[2024-06-01 12:43:31] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/259 places, 256/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57927 ms. Remains : 137/259 places, 256/749 transitions.
Support contains 21 out of 137 places after structural reductions.
[2024-06-01 12:43:31] [INFO ] Flatten gal took : 74 ms
[2024-06-01 12:43:31] [INFO ] Flatten gal took : 36 ms
[2024-06-01 12:43:31] [INFO ] Input system was already deterministic with 256 transitions.
Support contains 20 out of 137 places (down from 21) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8905 resets) in 4000 ms. (9 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (201 resets) in 65 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (185 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (396 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (183 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (193 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (188 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (167 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (195 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (169 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (188 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (161 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (193 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (197 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (195 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (188 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (179 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
[2024-06-01 12:43:33] [INFO ] Invariant cache hit.
[2024-06-01 12:43:33] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 66/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 31/115 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 241/356 variables, 115/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 147/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 8 (OVERLAPS) 37/393 variables, 22/288 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 15/303 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/393 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 303 constraints, problems are : Problem set: 1 solved, 15 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 66/84 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 31/115 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 241/356 variables, 115/119 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 147/266 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 37/393 variables, 22/288 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 15/303 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 15/318 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/393 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 318 constraints, problems are : Problem set: 1 solved, 15 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 4122ms problems are : Problem set: 1 solved, 15 unsolved
Parikh walk visited 0 properties in 37111 ms.
Support contains 18 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 256/256 transitions.
Graph (complete) has 467 edges and 137 vertex of which 136 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 136 transition count 254
Applied a total of 3 rules in 53 ms. Remains 136 /137 variables (removed 1) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 136/137 places, 254/256 transitions.
RANDOM walk for 40000 steps (8984 resets) in 446 ms. (89 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (184 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (210 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (396 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (193 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (174 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (194 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (187 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (206 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (186 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (193 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (168 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (172 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (184 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (180 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (182 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 329199 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :10 out of 15
Probabilistic random walk after 329199 steps, saw 152310 distinct states, run finished after 3006 ms. (steps per millisecond=109 ) properties seen :10
// Phase 1: matrix 254 rows 136 cols
[2024-06-01 12:44:17] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 12:44:17] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/78 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:44:18] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 167/245 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 73/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 145/390 variables, 58/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 87/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 301 constraints, problems are : Problem set: 0 solved, 5 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/78 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 167/245 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 73/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 145/390 variables, 58/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 87/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/390 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 306 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 33526 ms.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 254/254 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 180
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 126 transition count 179
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 117 transition count 169
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 117 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 113 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 113 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 113 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 111 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 111 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 109 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 109 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 107 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 107 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 69 place count 107 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 106 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 106 transition count 148
Applied a total of 71 rules in 57 ms. Remains 106 /136 variables (removed 30) and now considering 148/254 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 106/136 places, 148/254 transitions.
RANDOM walk for 40000 steps (9034 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1958 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 446392 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 5
Probabilistic random walk after 446392 steps, saw 190999 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 148 rows 106 cols
[2024-06-01 12:44:57] [INFO ] Computed 3 invariants in 7 ms
[2024-06-01 12:44:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 135/203 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 62/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 51/254 variables, 38/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 0 solved, 5 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 135/203 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 62/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 51/254 variables, 38/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/254 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 189 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4090 ms.
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 148/148 transitions.
Applied a total of 0 rules in 24 ms. Remains 106 /106 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 106/106 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 12:45:02] [INFO ] Invariant cache hit.
[2024-06-01 12:45:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 12:45:02] [INFO ] Invariant cache hit.
[2024-06-01 12:45:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 12:45:03] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-06-01 12:45:03] [INFO ] Redundant transitions in 5 ms returned []
Running 147 sub problems to find dead transitions.
[2024-06-01 12:45:03] [INFO ] Invariant cache hit.
[2024-06-01 12:45:03] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/254 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 75/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 0 solved, 147 unsolved in 7762 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/254 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 75/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 147/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 12:45:15] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:45:16] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 5 ms to minimize.
[2024-06-01 12:45:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 334 constraints, problems are : Problem set: 0 solved, 147 unsolved in 17418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 3/3 constraints]
After SMT, in 25368ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 25370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25834 ms. Remains : 106/106 places, 148/148 transitions.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 28 stabilizing places and 46 stable transitions
Graph (complete) has 519 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 123 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 110 transition count 137
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 110 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 110 transition count 131
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 102 transition count 123
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 102 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 102 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 98 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 94 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 94 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 91 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 89 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 46 ms. Remains 87 /137 variables (removed 50) and now considering 102/256 (removed 154) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:45:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:45:28] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 12:45:28] [INFO ] Invariant cache hit.
[2024-06-01 12:45:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 12:45:29] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-06-01 12:45:29] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 12:45:29] [INFO ] Invariant cache hit.
[2024-06-01 12:45:29] [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, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:45:32] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 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, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 239 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
After SMT, in 13052ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 13054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/137 places, 102/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13623 ms. Remains : 87/137 places, 102/256 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 finished in 13968 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) U p1)&&F(G(!p1))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 124 transition count 153
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 111 transition count 138
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 111 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 111 transition count 132
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 103 transition count 124
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 103 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 90 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 88 transition count 103
Applied a total of 111 rules in 57 ms. Remains 88 /137 variables (removed 49) and now considering 103/256 (removed 153) transitions.
// Phase 1: matrix 103 rows 88 cols
[2024-06-01 12:45:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:45:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 12:45:42] [INFO ] Invariant cache hit.
[2024-06-01 12:45:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 12:45:43] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-06-01 12:45:43] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2024-06-01 12:45:43] [INFO ] Invariant cache hit.
[2024-06-01 12:45:43] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/191 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 139 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5748 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 102/241 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 241 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
After SMT, in 12394ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12396ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/137 places, 103/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12973 ms. Remains : 88/137 places, 103/256 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p1), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 finished in 13196 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(F(p0))||(!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 124 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 112 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 112 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 112 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 104 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 104 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 104 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 100 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 100 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 96 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 96 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 93 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 93 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 93 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 91 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 91 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 90 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 89 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 89 transition count 111
Applied a total of 110 rules in 16 ms. Remains 89 /137 variables (removed 48) and now considering 111/256 (removed 145) transitions.
// Phase 1: matrix 111 rows 89 cols
[2024-06-01 12:45:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:45:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 12:45:56] [INFO ] Invariant cache hit.
[2024-06-01 12:45:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:45:56] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-06-01 12:45:56] [INFO ] Invariant cache hit.
[2024-06-01 12:45:56] [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, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 54/147 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 12:46:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/200 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 148 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6989 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 111/200 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 110/258 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 258 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 13086ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 13088ms
Starting structural reductions in LTL mode, iteration 1 : 89/137 places, 111/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13565 ms. Remains : 89/137 places, 111/256 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 650 ms.
Product exploration explored 100000 steps with 33333 reset in 461 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 289 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 32 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 finished in 14998 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||G(!p1))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 124 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 112 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 112 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 112 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 105 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 105 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 105 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 102 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 102 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 99 transition count 127
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 99 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 96 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 96 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 96 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 94 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 92 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 92 transition count 116
Applied a total of 102 rules in 27 ms. Remains 92 /137 variables (removed 45) and now considering 116/256 (removed 140) transitions.
// Phase 1: matrix 116 rows 92 cols
[2024-06-01 12:46:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:46:11] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 12:46:11] [INFO ] Invariant cache hit.
[2024-06-01 12:46:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 12:46:11] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-01 12:46:11] [INFO ] Invariant cache hit.
[2024-06-01 12:46:11] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/208 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 56/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 12:46:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/208 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 153 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6704 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 115/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 268 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
After SMT, in 14080ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 14082ms
Starting structural reductions in LTL mode, iteration 1 : 92/137 places, 116/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14583 ms. Remains : 92/137 places, 116/256 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-05
Product exploration explored 100000 steps with 22455 reset in 372 ms.
Product exploration explored 100000 steps with 22394 reset in 366 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 300 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, p1]
RANDOM walk for 40000 steps (8906 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 34427 steps, run visited all 1 properties in 80 ms. (steps per millisecond=430 )
Probabilistic random walk after 34427 steps, saw 15373 distinct states, run finished after 91 ms. (steps per millisecond=378 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 finished in 15965 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)||F(G(p1)))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 123 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 110 transition count 137
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 110 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 110 transition count 131
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 102 transition count 123
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 102 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 102 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 98 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 94 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 94 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 91 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 89 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 89 transition count 104
Applied a total of 109 rules in 15 ms. Remains 89 /137 variables (removed 48) and now considering 104/256 (removed 152) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 12:46:26] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:46:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 12:46:26] [INFO ] Invariant cache hit.
[2024-06-01 12:46:27] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:46:27] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 12:46:27] [INFO ] Invariant cache hit.
[2024-06-01 12:46:27] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:46:30] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:46:31] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 142 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 245 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 14129ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 14132ms
Starting structural reductions in LTL mode, iteration 1 : 89/137 places, 104/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14476 ms. Remains : 89/137 places, 104/256 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
Product exploration explored 100000 steps with 22418 reset in 300 ms.
Product exploration explored 100000 steps with 22501 reset in 148 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 283 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 18 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8950 resets) in 227 ms. (175 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (1893 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-06-01 12:46:42] [INFO ] Invariant cache hit.
[2024-06-01 12:46:42] [INFO ] State equation strengthened by 47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:46:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:46:42] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1005 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 104/104 transitions.
Graph (complete) has 249 edges and 89 vertex of which 88 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 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 100
Applied a total of 7 rules in 17 ms. Remains 86 /89 variables (removed 3) and now considering 100/104 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 86/89 places, 100/104 transitions.
RANDOM walk for 40000 steps (8984 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1907 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1926272 steps, run timeout after 3004 ms. (steps per millisecond=641 ) properties seen :0 out of 1
Probabilistic random walk after 1926272 steps, saw 796829 distinct states, run finished after 3004 ms. (steps per millisecond=641 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:46:46] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 12:46:46] [INFO ] State equation strengthened by 44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:46:47] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 543 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:46:48] [INFO ] Invariant cache hit.
[2024-06-01 12:46:48] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 12:46:48] [INFO ] Invariant cache hit.
[2024-06-01 12:46:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:46:48] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-01 12:46:48] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:46:48] [INFO ] Invariant cache hit.
[2024-06-01 12:46:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:46:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5758 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/186 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 12950ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13472 ms. Remains : 86/86 places, 100/100 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
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 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 29 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:47:01] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:47:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:47:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 12:47:01] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:47:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:47:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:47:01] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:47:01] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:47:01] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 104/104 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 12:47:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:47:02] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 12:47:02] [INFO ] Invariant cache hit.
[2024-06-01 12:47:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:47:02] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-06-01 12:47:02] [INFO ] Redundant transitions in 4 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 12:47:02] [INFO ] Invariant cache hit.
[2024-06-01 12:47:02] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 142 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 245 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5814 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 13690ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 13696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14260 ms. Remains : 89/89 places, 104/104 transitions.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 283 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 18 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8910 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2024-06-01 12:47:16] [INFO ] Invariant cache hit.
[2024-06-01 12:47:16] [INFO ] State equation strengthened by 47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:47:17] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:47:17] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 843 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 104/104 transitions.
Graph (complete) has 249 edges and 89 vertex of which 88 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 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 100
Applied a total of 7 rules in 8 ms. Remains 86 /89 variables (removed 3) and now considering 100/104 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/89 places, 100/104 transitions.
RANDOM walk for 40000 steps (8952 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1852 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2265951 steps, run timeout after 3001 ms. (steps per millisecond=755 ) properties seen :0 out of 1
Probabilistic random walk after 2265951 steps, saw 936162 distinct states, run finished after 3001 ms. (steps per millisecond=755 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:47:21] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:47:21] [INFO ] State equation strengthened by 44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:47:21] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 321 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:47:21] [INFO ] Invariant cache hit.
[2024-06-01 12:47:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:47:21] [INFO ] Invariant cache hit.
[2024-06-01 12:47:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:47:22] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-06-01 12:47:22] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:47:22] [INFO ] Invariant cache hit.
[2024-06-01 12:47:22] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:47:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/186 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 8837ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9170 ms. Remains : 86/86 places, 100/100 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
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 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 6 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:47:31] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:47:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:47:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 12:47:31] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:47:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:47:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:47:31] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:47:31] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:47:31] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 227 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22400 reset in 146 ms.
Product exploration explored 100000 steps with 22487 reset in 161 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 12:47:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:47:32] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 12:47:32] [INFO ] Invariant cache hit.
[2024-06-01 12:47:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:47:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-01 12:47:32] [INFO ] Redundant transitions in 0 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 12:47:32] [INFO ] Invariant cache hit.
[2024-06-01 12:47:32] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:47:35] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:47:35] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 142 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 245 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 10525ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10526ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10885 ms. Remains : 89/89 places, 104/104 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 finished in 76085 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((!p0 U G(!p1)))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 124 transition count 154
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 112 transition count 141
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 112 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 112 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 105 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 105 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 105 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 102 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 102 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 99 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 97 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 97 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 97 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 96 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 96 transition count 114
Applied a total of 94 rules in 15 ms. Remains 96 /137 variables (removed 41) and now considering 114/256 (removed 142) transitions.
// Phase 1: matrix 114 rows 96 cols
[2024-06-01 12:47:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:47:43] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 12:47:43] [INFO ] Invariant cache hit.
[2024-06-01 12:47:43] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:47:43] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 12:47:43] [INFO ] Invariant cache hit.
[2024-06-01 12:47:43] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 12763ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12765ms
Starting structural reductions in LTL mode, iteration 1 : 96/137 places, 114/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13318 ms. Remains : 96/137 places, 114/256 transitions.
Stuttering acceptance computed with spot in 161 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
Product exploration explored 100000 steps with 22447 reset in 167 ms.
Product exploration explored 100000 steps with 22383 reset in 180 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 307 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[p1, p1, p1, true, p1]
RANDOM walk for 40000 steps (9020 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1922 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1952 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1936 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 426418 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 6
Probabilistic random walk after 426418 steps, saw 189347 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2024-06-01 12:48:00] [INFO ] Invariant cache hit.
[2024-06-01 12:48:00] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 12:48:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 101/177 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 38/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 33/210 variables, 20/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 13/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 152 constraints, problems are : Problem set: 1 solved, 5 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 101/177 variables, 76/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 38/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 33/210 variables, 20/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 13/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 5/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 157 constraints, problems are : Problem set: 1 solved, 5 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 839ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10254 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 114/114 transitions.
Graph (complete) has 271 edges and 96 vertex of which 95 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 95 transition count 112
Applied a total of 3 rules in 4 ms. Remains 95 /96 variables (removed 1) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 95/96 places, 112/114 transitions.
RANDOM walk for 40000 steps (8944 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1969 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1989 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1975 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 245209 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 5
Probabilistic random walk after 245209 steps, saw 108747 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 112 rows 95 cols
[2024-06-01 12:48:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:48:15] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:48:15] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 99/160 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 47/207 variables, 34/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 5 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:48:15] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 99/160 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 47/207 variables, 34/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 154 constraints, problems are : Problem set: 0 solved, 5 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 977ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21576 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 95/95 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 10 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 12:48:37] [INFO ] Invariant cache hit.
[2024-06-01 12:48:37] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 12:48:37] [INFO ] Invariant cache hit.
[2024-06-01 12:48:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:48:38] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-01 12:48:38] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 12:48:38] [INFO ] Invariant cache hit.
[2024-06-01 12:48:38] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/207 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 49/147 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:48:39] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4370 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/207 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 111/259 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:48:44] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 260 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7821 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 12296ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 12299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12675 ms. Remains : 95/95 places, 112/112 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 89 transition count 105
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 89 transition count 89
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 73 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 66 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 66 transition count 82
Applied a total of 61 rules in 20 ms. Remains 66 /95 variables (removed 29) and now considering 82/112 (removed 30) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 82 rows 66 cols
[2024-06-01 12:48:50] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:48:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:48:50] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 12:48:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:48:50] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-06-01 12:48:50] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-06-01 12:48:50] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 12:48:50] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 645 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 147 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 96 cols
[2024-06-01 12:48:51] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:48:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:48:51] [INFO ] Invariant cache hit.
[2024-06-01 12:48:51] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:48:51] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 12:48:51] [INFO ] Invariant cache hit.
[2024-06-01 12:48:51] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:48:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:48:57] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:48:57] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 12399ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12402ms
Finished structural reductions in LTL mode , in 1 iterations and 12789 ms. Remains : 96/96 places, 114/114 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 307 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p1, p1, p1, true, p1]
RANDOM walk for 40000 steps (8987 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1830 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1941 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 563632 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 3
Probabilistic random walk after 563632 steps, saw 248539 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2024-06-01 12:49:07] [INFO ] Invariant cache hit.
[2024-06-01 12:49:07] [INFO ] State equation strengthened by 51 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) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/177 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 38/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 33/210 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 3 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/177 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 38/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 33/210 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 154 constraints, problems are : Problem set: 0 solved, 3 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17716 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 114/114 transitions.
Graph (complete) has 271 edges and 96 vertex of which 95 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 95 transition count 112
Applied a total of 3 rules in 11 ms. Remains 95 /96 variables (removed 1) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 95/96 places, 112/114 transitions.
RANDOM walk for 40000 steps (8967 resets) in 112 ms. (353 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1986 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1944 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 424488 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 3
Probabilistic random walk after 424488 steps, saw 188578 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
// Phase 1: matrix 112 rows 95 cols
[2024-06-01 12:49:29] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 12:49:29] [INFO ] State equation strengthened by 49 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) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:49:29] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 99/160 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 47/207 variables, 34/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:49:29] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 99/160 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 47/207 variables, 34/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:49:30] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 825ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 15925 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 95/95 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 12:49:46] [INFO ] Invariant cache hit.
[2024-06-01 12:49:46] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 12:49:46] [INFO ] Invariant cache hit.
[2024-06-01 12:49:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:49:46] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-01 12:49:46] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 12:49:46] [INFO ] Invariant cache hit.
[2024-06-01 12:49:46] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/207 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 49/147 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:49:48] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4535 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/207 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 111/259 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 260 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7896 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 12540ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 12542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12950 ms. Remains : 95/95 places, 112/112 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 89 transition count 105
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 89 transition count 89
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 73 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 66 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 66 transition count 82
Applied a total of 61 rules in 12 ms. Remains 66 /95 variables (removed 29) and now considering 82/112 (removed 30) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 82 rows 66 cols
[2024-06-01 12:49:59] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:49:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:49:59] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 12:49:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:49:59] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 12:49:59] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:49:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:49:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
TRAPS : Iteration 1
[2024-06-01 12:49:59] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 12:49:59] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 477 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 179 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22382 reset in 156 ms.
Product exploration explored 100000 steps with 22367 reset in 171 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 114/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 12:50:00] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
// Phase 1: matrix 114 rows 96 cols
[2024-06-01 12:50:00] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:50:00] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:50:03] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:50:03] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:50:04] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 154 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6216 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/210 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 113/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6580 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 12906ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12919 ms. Remains : 96/96 places, 114/114 transitions.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 12:50:13] [INFO ] Invariant cache hit.
[2024-06-01 12:50:13] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 12:50:13] [INFO ] Invariant cache hit.
[2024-06-01 12:50:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:50:14] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 12:50:14] [INFO ] Invariant cache hit.
[2024-06-01 12:50:14] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:50:20] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2024-06-01 12:50:20] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:50:20] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8998 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 12631ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12632ms
Finished structural reductions in LTL mode , in 1 iterations and 13006 ms. Remains : 96/96 places, 114/114 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 163981 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(p1)&&p0) U G(p2))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 124 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 112 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 112 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 112 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 105 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 105 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 105 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 78 place count 101 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 86 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 97 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 94 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 94 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 92 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 90 transition count 113
Applied a total of 107 rules in 13 ms. Remains 90 /137 variables (removed 47) and now considering 113/256 (removed 143) transitions.
// Phase 1: matrix 113 rows 90 cols
[2024-06-01 12:50:26] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:50:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 12:50:27] [INFO ] Invariant cache hit.
[2024-06-01 12:50:27] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:50:27] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-06-01 12:50:27] [INFO ] Invariant cache hit.
[2024-06-01 12:50:27] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 148 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 112/260 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:50:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 261 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 11402ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 11404ms
Starting structural reductions in LTL mode, iteration 1 : 90/137 places, 113/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11736 ms. Remains : 90/137 places, 113/256 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 finished in 11976 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((F((p0||G(!p1)))||(p2 U p3)))))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 173
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 126 transition count 172
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 116 transition count 161
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 116 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 116 transition count 156
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 110 transition count 150
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 110 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 110 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 108 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 108 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 106 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 106 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 105 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 105 transition count 143
Applied a total of 72 rules in 16 ms. Remains 105 /137 variables (removed 32) and now considering 143/256 (removed 113) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-06-01 12:50:38] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:50:39] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 12:50:39] [INFO ] Invariant cache hit.
[2024-06-01 12:50:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 12:50:39] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-06-01 12:50:39] [INFO ] Invariant cache hit.
[2024-06-01 12:50:39] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4977 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 328 constraints, problems are : Problem set: 0 solved, 142 unsolved in 11927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
After SMT, in 17072ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 17074ms
Starting structural reductions in LTL mode, iteration 1 : 105/137 places, 143/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17965 ms. Remains : 105/137 places, 143/256 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
Product exploration explored 100000 steps with 22439 reset in 194 ms.
Product exploration explored 100000 steps with 22460 reset in 210 ms.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 351 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 144 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3))]
RANDOM walk for 40000 steps (9036 resets) in 464 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1934 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1943 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1975 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 423501 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :6 out of 9
Probabilistic random walk after 423501 steps, saw 187720 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :6
[2024-06-01 12:51:01] [INFO ] Invariant cache hit.
[2024-06-01 12:51:01] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/83 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 128/211 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 37/248 variables, 22/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 15/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 1 solved, 2 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 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) 65/68 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:51:02] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/82 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 119/201 variables, 82/87 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 50/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/248 variables, 23/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 24/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:51:02] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:51:02] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 2/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 188 constraints, problems are : Problem set: 1 solved, 2 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 785ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 8310 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 143/143 transitions.
Graph (complete) has 311 edges and 105 vertex of which 104 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 104 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 102 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 102 transition count 131
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 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 100 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 100 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 98 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 98 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 96 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 96 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 94 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 94 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 92 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 92 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 92 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 90 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 89 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 88 transition count 109
Applied a total of 41 rules in 29 ms. Remains 88 /105 variables (removed 17) and now considering 109/143 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 88/105 places, 109/143 transitions.
RANDOM walk for 40000 steps (8936 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1946 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1972 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 504118 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 504118 steps, saw 218103 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
// Phase 1: matrix 109 rows 88 cols
[2024-06-01 12:51:14] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:51:14] [INFO ] State equation strengthened by 52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/197 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/197 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:51:14] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1113 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/88 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 12:51:15] [INFO ] Invariant cache hit.
[2024-06-01 12:51:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 12:51:16] [INFO ] Invariant cache hit.
[2024-06-01 12:51:16] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 12:51:16] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-01 12:51:16] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 12:51:16] [INFO ] Invariant cache hit.
[2024-06-01 12:51:16] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 108/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:51:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 252 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8706 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 11832ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12205 ms. Remains : 88/88 places, 109/109 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 88 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 82 transition count 102
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 82 transition count 88
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 41 place count 68 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 61 transition count 81
Applied a total of 55 rules in 4 ms. Remains 61 /88 variables (removed 27) and now considering 81/109 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 61 cols
[2024-06-01 12:51:28] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:51:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 12:51:28] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:51:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 12:51:28] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:51:28] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:51:28] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 257 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p2), (F p3), (F p0)]
Knowledge based reduction with 17 factoid took 273 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p0) p1)]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 143/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-06-01 12:51:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:51:28] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 12:51:28] [INFO ] Invariant cache hit.
[2024-06-01 12:51:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 12:51:29] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-01 12:51:29] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 12:51:29] [INFO ] Invariant cache hit.
[2024-06-01 12:51:29] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 12:51:37] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:51:37] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:51:37] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 328 constraints, problems are : Problem set: 0 solved, 142 unsolved in 11748 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
After SMT, in 16778ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 16780ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17192 ms. Remains : 105/105 places, 143/143 transitions.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 351 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8931 resets) in 389 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 265 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1914 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 488215 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :5 out of 7
Probabilistic random walk after 488215 steps, saw 215151 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :5
[2024-06-01 12:51:50] [INFO ] Invariant cache hit.
[2024-06-01 12:51:50] [INFO ] State equation strengthened by 74 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) 65/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/201 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/248 variables, 23/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 24/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 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) 65/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 119/201 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 50/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/248 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 24/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 8114 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 143/143 transitions.
Graph (complete) has 311 edges and 105 vertex of which 104 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 104 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 102 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 102 transition count 131
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 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 100 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 100 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 98 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 98 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 96 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 96 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 94 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 94 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 92 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 92 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 92 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 90 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 89 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 88 transition count 109
Applied a total of 41 rules in 13 ms. Remains 88 /105 variables (removed 17) and now considering 109/143 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 88/105 places, 109/143 transitions.
RANDOM walk for 40000 steps (8897 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 528397 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 2
Probabilistic random walk after 528397 steps, saw 228610 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 109 rows 88 cols
[2024-06-01 12:52:02] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:52:02] [INFO ] State equation strengthened by 52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/197 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/197 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:52:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1066 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 88/88 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 12:52:03] [INFO ] Invariant cache hit.
[2024-06-01 12:52:03] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 12:52:03] [INFO ] Invariant cache hit.
[2024-06-01 12:52:03] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 12:52:04] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-01 12:52:04] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 12:52:04] [INFO ] Invariant cache hit.
[2024-06-01 12:52:04] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3004 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 108/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:52:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 252 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8579 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 11684ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12030 ms. Remains : 88/88 places, 109/109 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 88 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 82 transition count 102
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 82 transition count 88
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 41 place count 68 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 61 transition count 81
Applied a total of 55 rules in 5 ms. Remains 61 /88 variables (removed 27) and now considering 81/109 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 61 cols
[2024-06-01 12:52:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:52:15] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:52:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 12:52:16] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:52:16] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:52:16] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F p3)]
Knowledge based reduction with 9 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22241 reset in 191 ms.
Product exploration explored 100000 steps with 22404 reset in 208 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 143/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-06-01 12:52:16] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:52:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 12:52:17] [INFO ] Invariant cache hit.
[2024-06-01 12:52:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 12:52:17] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-06-01 12:52:17] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 12:52:17] [INFO ] Invariant cache hit.
[2024-06-01 12:52:17] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 12:52:25] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:52:25] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:52:25] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 328 constraints, problems are : Problem set: 0 solved, 142 unsolved in 11868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
After SMT, in 16806ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 16808ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17246 ms. Remains : 105/105 places, 143/143 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 115344 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))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 123 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 110 transition count 137
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 110 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 110 transition count 131
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 102 transition count 123
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 102 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 102 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 98 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 94 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 94 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 91 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 89 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 12 ms. Remains 87 /137 variables (removed 50) and now considering 102/256 (removed 154) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:52:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:52:34] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 12:52:34] [INFO ] Invariant cache hit.
[2024-06-01 12:52:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 12:52:34] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 12:52:34] [INFO ] Invariant cache hit.
[2024-06-01 12:52:34] [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, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 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, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:52:39] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 239 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
After SMT, in 9730ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9731ms
Starting structural reductions in LTL mode, iteration 1 : 87/137 places, 102/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10068 ms. Remains : 87/137 places, 102/256 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 277 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 41 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 finished in 10759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 124 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 112 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 112 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 112 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 105 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 105 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 105 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 102 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 102 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 99 transition count 127
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 99 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 97 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 94 transition count 121
Applied a total of 95 rules in 11 ms. Remains 94 /137 variables (removed 43) and now considering 121/256 (removed 135) transitions.
// Phase 1: matrix 121 rows 94 cols
[2024-06-01 12:52:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:52:45] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 12:52:45] [INFO ] Invariant cache hit.
[2024-06-01 12:52:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:52:45] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 12:52:45] [INFO ] Invariant cache hit.
[2024-06-01 12:52:45] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 12:52:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 12066ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12068ms
Starting structural reductions in LTL mode, iteration 1 : 94/137 places, 121/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12679 ms. Remains : 94/137 places, 121/256 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
Product exploration explored 100000 steps with 24307 reset in 362 ms.
Product exploration explored 100000 steps with 24410 reset in 242 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 308 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 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (9039 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1949 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1951 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1831 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2034587 steps, run timeout after 3001 ms. (steps per millisecond=677 ) properties seen :3 out of 4
Probabilistic random walk after 2034587 steps, saw 895237 distinct states, run finished after 3001 ms. (steps per millisecond=677 ) properties seen :3
[2024-06-01 12:53:02] [INFO ] Invariant cache hit.
[2024-06-01 12:53:02] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:53:02] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/178 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 215/215 variables, and 144 constraints, problems are : Problem set: 1 solved, 0 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 45/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 174ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 12:53:03] [INFO ] Invariant cache hit.
[2024-06-01 12:53:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 12:53:03] [INFO ] Invariant cache hit.
[2024-06-01 12:53:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:53:03] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 12:53:03] [INFO ] Invariant cache hit.
[2024-06-01 12:53:03] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 12:53:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 12088ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12095ms
Finished structural reductions in LTL mode , in 1 iterations and 12475 ms. Remains : 94/94 places, 121/121 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 308 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 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8965 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1921 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9202 steps, run visited all 2 properties in 23 ms. (steps per millisecond=400 )
Probabilistic random walk after 9202 steps, saw 4534 distinct states, run finished after 23 ms. (steps per millisecond=400 ) properties seen :2
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 24533 reset in 146 ms.
Product exploration explored 100000 steps with 24392 reset in 164 ms.
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 12:53:17] [INFO ] Invariant cache hit.
[2024-06-01 12:53:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 12:53:17] [INFO ] Invariant cache hit.
[2024-06-01 12:53:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:53:17] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 12:53:17] [INFO ] Invariant cache hit.
[2024-06-01 12:53:17] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 12:53:24] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 12364ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12366ms
Finished structural reductions in LTL mode , in 1 iterations and 12834 ms. Remains : 94/94 places, 121/121 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 finished in 45331 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)||F(G(p1)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 123 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 110 transition count 137
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 110 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 110 transition count 131
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 102 transition count 123
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 102 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 102 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 98 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 94 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 94 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 91 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 89 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 89 transition count 104
Applied a total of 109 rules in 26 ms. Remains 89 /137 variables (removed 48) and now considering 104/256 (removed 152) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 12:53:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:53:30] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 12:53:30] [INFO ] Invariant cache hit.
[2024-06-01 12:53:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:53:31] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 12:53:31] [INFO ] Invariant cache hit.
[2024-06-01 12:53:31] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:53:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:53:34] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 142 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 245 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 10500ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10502ms
Starting structural reductions in LI_LTL mode, iteration 1 : 89/137 places, 104/256 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11050 ms. Remains : 89/137 places, 104/256 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
Product exploration explored 100000 steps with 22424 reset in 139 ms.
Product exploration explored 100000 steps with 22389 reset in 153 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 283 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 18 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9033 resets) in 92 ms. (430 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-06-01 12:53:42] [INFO ] Invariant cache hit.
[2024-06-01 12:53:42] [INFO ] State equation strengthened by 47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:53:42] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:53:42] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 831 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 104/104 transitions.
Graph (complete) has 249 edges and 89 vertex of which 88 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 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 100
Applied a total of 7 rules in 4 ms. Remains 86 /89 variables (removed 3) and now considering 100/104 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/89 places, 100/104 transitions.
RANDOM walk for 40000 steps (8968 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1904 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2312211 steps, run timeout after 3001 ms. (steps per millisecond=770 ) properties seen :0 out of 1
Probabilistic random walk after 2312211 steps, saw 955216 distinct states, run finished after 3001 ms. (steps per millisecond=770 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:53:46] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:53:46] [INFO ] State equation strengthened by 44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:53:46] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 320 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:53:47] [INFO ] Invariant cache hit.
[2024-06-01 12:53:47] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 12:53:47] [INFO ] Invariant cache hit.
[2024-06-01 12:53:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:53:47] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-06-01 12:53:47] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:53:47] [INFO ] Invariant cache hit.
[2024-06-01 12:53:47] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:53:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/186 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5245 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 8709ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8710ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9200 ms. Remains : 86/86 places, 100/100 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
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 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 22 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:53:56] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:53:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:53:56] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:53:56] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:53:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:53:56] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:53:56] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:53:56] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:53:56] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 390 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 12:53:57] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:53:57] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 12:53:57] [INFO ] Invariant cache hit.
[2024-06-01 12:53:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:53:57] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-01 12:53:57] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 12:53:57] [INFO ] Invariant cache hit.
[2024-06-01 12:53:57] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:54:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:54:00] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 142 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 245 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 10755ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10756ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11163 ms. Remains : 89/89 places, 104/104 transitions.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 283 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 18 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9055 resets) in 99 ms. (400 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-06-01 12:54:08] [INFO ] Invariant cache hit.
[2024-06-01 12:54:08] [INFO ] State equation strengthened by 47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 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) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/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) 3/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/160 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/193 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:54:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:54:08] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 839 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 104/104 transitions.
Graph (complete) has 249 edges and 89 vertex of which 88 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 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 100
Applied a total of 7 rules in 8 ms. Remains 86 /89 variables (removed 3) and now considering 100/104 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/89 places, 100/104 transitions.
RANDOM walk for 40000 steps (9011 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2312146 steps, run timeout after 3001 ms. (steps per millisecond=770 ) properties seen :0 out of 1
Probabilistic random walk after 2312146 steps, saw 955183 distinct states, run finished after 3001 ms. (steps per millisecond=770 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:54:12] [INFO ] Computed 3 invariants in 14 ms
[2024-06-01 12:54:12] [INFO ] State equation strengthened by 44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:54:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:54:13] [INFO ] Invariant cache hit.
[2024-06-01 12:54:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 12:54:13] [INFO ] Invariant cache hit.
[2024-06-01 12:54:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:54:14] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-01 12:54:14] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:54:14] [INFO ] Invariant cache hit.
[2024-06-01 12:54:14] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:54:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3379 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/186 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5289 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 8760ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9108 ms. Remains : 86/86 places, 100/100 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
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 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 4 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:54:22] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:54:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:54:22] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 16 ms returned sat
[2024-06-01 12:54:23] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:54:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:54:23] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:54:23] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:54:23] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:54:23] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 293 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22519 reset in 140 ms.
Product exploration explored 100000 steps with 22479 reset in 162 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 12:54:23] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:54:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:54:23] [INFO ] Invariant cache hit.
[2024-06-01 12:54:23] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:54:24] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-06-01 12:54:24] [INFO ] Redundant transitions in 0 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 12:54:24] [INFO ] Invariant cache hit.
[2024-06-01 12:54:24] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:54:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/193 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 12:54:27] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 142 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 103/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 245 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 10501ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10502ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10850 ms. Remains : 89/89 places, 104/104 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 finished in 64367 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((!p0 U G(!p1)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
Stuttering acceptance computed with spot in 233 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 124 transition count 154
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 112 transition count 141
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 112 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 112 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 105 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 105 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 105 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 102 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 102 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 99 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 97 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 97 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 97 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 96 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 96 transition count 114
Applied a total of 94 rules in 15 ms. Remains 96 /137 variables (removed 41) and now considering 114/256 (removed 142) transitions.
// Phase 1: matrix 114 rows 96 cols
[2024-06-01 12:54:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:54:35] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 12:54:35] [INFO ] Invariant cache hit.
[2024-06-01 12:54:35] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:54:35] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 12:54:35] [INFO ] Invariant cache hit.
[2024-06-01 12:54:35] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:54:41] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:54:41] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:54:41] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 12443ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12447ms
Starting structural reductions in LI_LTL mode, iteration 1 : 96/137 places, 114/256 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12954 ms. Remains : 96/137 places, 114/256 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
Product exploration explored 100000 steps with 22409 reset in 165 ms.
Product exploration explored 100000 steps with 22485 reset in 189 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 307 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[p1, p1, p1, true, p1]
RANDOM walk for 40000 steps (8959 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1970 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1928 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 523175 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 6
Probabilistic random walk after 523175 steps, saw 229111 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-06-01 12:54:52] [INFO ] Invariant cache hit.
[2024-06-01 12:54:52] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 12:54:52] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 101/177 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 38/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 33/210 variables, 20/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 13/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 152 constraints, problems are : Problem set: 1 solved, 5 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 101/177 variables, 76/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 38/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 33/210 variables, 20/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 13/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 5/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 157 constraints, problems are : Problem set: 1 solved, 5 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 910ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14043 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 114/114 transitions.
Graph (complete) has 271 edges and 96 vertex of which 95 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 95 transition count 112
Applied a total of 3 rules in 4 ms. Remains 95 /96 variables (removed 1) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 95/96 places, 112/114 transitions.
RANDOM walk for 40000 steps (9074 resets) in 353 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1946 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1929 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1896 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 308892 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 5
Probabilistic random walk after 308892 steps, saw 137585 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 112 rows 95 cols
[2024-06-01 12:55:10] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:55:10] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:55:10] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 99/160 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 47/207 variables, 34/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 5 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:55:11] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 99/160 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 47/207 variables, 34/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 154 constraints, problems are : Problem set: 0 solved, 5 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17259 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 95/95 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 12:55:28] [INFO ] Invariant cache hit.
[2024-06-01 12:55:29] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 12:55:29] [INFO ] Invariant cache hit.
[2024-06-01 12:55:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:55:29] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-06-01 12:55:29] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 12:55:29] [INFO ] Invariant cache hit.
[2024-06-01 12:55:29] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/207 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 49/147 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:55:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/207 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 111/259 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:55:37] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 260 constraints, problems are : Problem set: 0 solved, 111 unsolved in 10376 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 15330ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 15332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15726 ms. Remains : 95/95 places, 112/112 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 89 transition count 105
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 89 transition count 89
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 73 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 66 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 66 transition count 82
Applied a total of 61 rules in 6 ms. Remains 66 /95 variables (removed 29) and now considering 82/112 (removed 30) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 82 rows 66 cols
[2024-06-01 12:55:44] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:55:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:55:44] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 12:55:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:55:45] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-01 12:55:45] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2024-06-01 12:55:45] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 12:55:45] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 917 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 224 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 96 cols
[2024-06-01 12:55:46] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:55:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 12:55:46] [INFO ] Invariant cache hit.
[2024-06-01 12:55:46] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:55:46] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 12:55:46] [INFO ] Invariant cache hit.
[2024-06-01 12:55:46] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:55:55] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:55:55] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:55:55] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 16808ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 16811ms
Finished structural reductions in LTL mode , in 1 iterations and 17334 ms. Remains : 96/96 places, 114/114 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 307 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p1, p1, p1, true, p1]
RANDOM walk for 40000 steps (8963 resets) in 357 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1919 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 391023 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 3
Probabilistic random walk after 391023 steps, saw 173193 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2024-06-01 12:56:07] [INFO ] Invariant cache hit.
[2024-06-01 12:56:07] [INFO ] State equation strengthened by 51 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) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/177 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 38/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 33/210 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 3 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/177 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 38/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 33/210 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 154 constraints, problems are : Problem set: 0 solved, 3 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 693ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18751 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 114/114 transitions.
Graph (complete) has 271 edges and 96 vertex of which 95 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 95 transition count 112
Applied a total of 3 rules in 4 ms. Remains 95 /96 variables (removed 1) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 95/96 places, 112/114 transitions.
RANDOM walk for 40000 steps (9003 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1983 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 446749 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 3
Probabilistic random walk after 446749 steps, saw 197761 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 112 rows 95 cols
[2024-06-01 12:56:29] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:56:29] [INFO ] State equation strengthened by 49 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) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:56:29] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 99/160 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 47/207 variables, 34/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 99/160 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 47/207 variables, 34/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1086ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 15781 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 95/95 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 12:56:46] [INFO ] Invariant cache hit.
[2024-06-01 12:56:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 12:56:46] [INFO ] Invariant cache hit.
[2024-06-01 12:56:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:56:47] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-01 12:56:47] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 12:56:47] [INFO ] Invariant cache hit.
[2024-06-01 12:56:47] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/207 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 49/147 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 148 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/207 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 111/259 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 260 constraints, problems are : Problem set: 0 solved, 111 unsolved in 10326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 17024ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 17025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17362 ms. Remains : 95/95 places, 112/112 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 89 transition count 105
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 89 transition count 89
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 73 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 66 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 66 transition count 82
Applied a total of 61 rules in 11 ms. Remains 66 /95 variables (removed 29) and now considering 82/112 (removed 30) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 82 rows 66 cols
[2024-06-01 12:57:04] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:57:04] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 12:57:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 12:57:04] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:57:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
TRAPS : Iteration 1
[2024-06-01 12:57:04] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 12:57:04] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 507 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 228 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 224 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22393 reset in 244 ms.
Product exploration explored 100000 steps with 22398 reset in 279 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 114/114 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 12:57:06] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
// Phase 1: matrix 114 rows 96 cols
[2024-06-01 12:57:06] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:57:06] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 154 constraints, problems are : Problem set: 0 solved, 113 unsolved in 7200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/210 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 113/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 7781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 15161ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 15163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15179 ms. Remains : 96/96 places, 114/114 transitions.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 12:57:21] [INFO ] Invariant cache hit.
[2024-06-01 12:57:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 12:57:21] [INFO ] Invariant cache hit.
[2024-06-01 12:57:21] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:57:21] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 12:57:21] [INFO ] Invariant cache hit.
[2024-06-01 12:57:21] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 151 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/210 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 12:57:29] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:57:29] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:57:29] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 267 constraints, problems are : Problem set: 0 solved, 113 unsolved in 10273 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 15321ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 15324ms
Finished structural reductions in LTL mode , in 1 iterations and 15805 ms. Remains : 96/96 places, 114/114 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 182556 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((F((p0||G(!p1)))||(p2 U p3)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3))]
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 173
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 126 transition count 172
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 116 transition count 161
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 116 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 116 transition count 156
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 110 transition count 150
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 110 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 110 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 108 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 108 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 106 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 106 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 105 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 105 transition count 143
Applied a total of 72 rules in 21 ms. Remains 105 /137 variables (removed 32) and now considering 143/256 (removed 113) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-06-01 12:57:37] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 12:57:37] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 12:57:37] [INFO ] Invariant cache hit.
[2024-06-01 12:57:37] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 12:57:38] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-06-01 12:57:38] [INFO ] Invariant cache hit.
[2024-06-01 12:57:38] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 328 constraints, problems are : Problem set: 0 solved, 142 unsolved in 14521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
After SMT, in 21098ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 21101ms
Starting structural reductions in LI_LTL mode, iteration 1 : 105/137 places, 143/256 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 21757 ms. Remains : 105/137 places, 143/256 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
Product exploration explored 100000 steps with 22464 reset in 180 ms.
Product exploration explored 100000 steps with 22570 reset in 194 ms.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 351 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 138 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3))]
RANDOM walk for 40000 steps (8914 resets) in 411 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 331 ms. (120 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1862 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1931 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (1910 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1967 resets) in 232 ms. (171 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 374696 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :6 out of 9
Probabilistic random walk after 374696 steps, saw 165773 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :6
[2024-06-01 12:58:04] [INFO ] Invariant cache hit.
[2024-06-01 12:58:04] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/83 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 128/211 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 37/248 variables, 22/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 15/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 1 solved, 2 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 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) 65/68 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:58:04] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/82 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 119/201 variables, 82/87 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 50/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/248 variables, 23/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 24/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:58:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:58:04] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 2/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 188 constraints, problems are : Problem set: 1 solved, 2 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 914ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 7537 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 143/143 transitions.
Graph (complete) has 311 edges and 105 vertex of which 104 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 104 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 102 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 102 transition count 131
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 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 100 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 100 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 98 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 98 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 96 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 96 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 94 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 94 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 92 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 92 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 92 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 90 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 89 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 88 transition count 109
Applied a total of 41 rules in 20 ms. Remains 88 /105 variables (removed 17) and now considering 109/143 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 88/105 places, 109/143 transitions.
RANDOM walk for 40000 steps (9033 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1929 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 549729 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 2
Probabilistic random walk after 549729 steps, saw 238181 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 109 rows 88 cols
[2024-06-01 12:58:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:58:15] [INFO ] State equation strengthened by 52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/197 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/197 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:58:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1124 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 88/88 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 12:58:17] [INFO ] Invariant cache hit.
[2024-06-01 12:58:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 12:58:17] [INFO ] Invariant cache hit.
[2024-06-01 12:58:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 12:58:18] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-06-01 12:58:18] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 12:58:18] [INFO ] Invariant cache hit.
[2024-06-01 12:58:18] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3052 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 108/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 252 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10178 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 13321ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 13323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13679 ms. Remains : 88/88 places, 109/109 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 88 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 82 transition count 102
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 82 transition count 88
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 68 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 61 transition count 81
Applied a total of 55 rules in 8 ms. Remains 61 /88 variables (removed 27) and now considering 81/109 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 61 cols
[2024-06-01 12:58:31] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 12:58:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:58:31] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:58:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:58:31] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:58:31] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:58:31] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 395 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p2), (F p3), (F p0)]
Knowledge based reduction with 17 factoid took 356 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2) (NOT p3) p1), (AND (NOT p0) p1)]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 143/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-06-01 12:58:32] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:58:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 12:58:32] [INFO ] Invariant cache hit.
[2024-06-01 12:58:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 12:58:32] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-06-01 12:58:32] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 12:58:33] [INFO ] Invariant cache hit.
[2024-06-01 12:58:33] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 328 constraints, problems are : Problem set: 0 solved, 142 unsolved in 14288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
After SMT, in 20955ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 20958ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21593 ms. Remains : 105/105 places, 143/143 transitions.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 351 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8954 resets) in 436 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1957 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1920 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1947 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1924 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 483235 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :5 out of 7
Probabilistic random walk after 483235 steps, saw 213175 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :5
[2024-06-01 12:58:57] [INFO ] Invariant cache hit.
[2024-06-01 12:58:57] [INFO ] State equation strengthened by 74 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) 65/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/201 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/248 variables, 23/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 24/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 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) 65/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:58:58] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 119/201 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 50/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/248 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 24/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:58:58] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:58:58] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1074ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 8159 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 143/143 transitions.
Graph (complete) has 311 edges and 105 vertex of which 104 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 104 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 102 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 102 transition count 131
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 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 100 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 100 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 98 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 98 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 96 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 96 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 94 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 94 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 92 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 92 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 92 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 90 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 89 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 88 transition count 109
Applied a total of 41 rules in 16 ms. Remains 88 /105 variables (removed 17) and now considering 109/143 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 88/105 places, 109/143 transitions.
RANDOM walk for 40000 steps (8982 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1902 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1957 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 558965 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 2
Probabilistic random walk after 558965 steps, saw 242298 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
// Phase 1: matrix 109 rows 88 cols
[2024-06-01 12:59:10] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:59:10] [INFO ] State equation strengthened by 52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/197 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 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) 73/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/191 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/197 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:59:10] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1611 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 88/88 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-01 12:59:12] [INFO ] Invariant cache hit.
[2024-06-01 12:59:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 12:59:12] [INFO ] Invariant cache hit.
[2024-06-01 12:59:12] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 12:59:12] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-01 12:59:12] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 12:59:12] [INFO ] Invariant cache hit.
[2024-06-01 12:59:12] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4564 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 108/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 252 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 15102ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 15103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15506 ms. Remains : 88/88 places, 109/109 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 88 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 82 transition count 102
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 82 transition count 88
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 41 place count 68 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 61 transition count 81
Applied a total of 55 rules in 4 ms. Remains 61 /88 variables (removed 27) and now considering 81/109 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 61 cols
[2024-06-01 12:59:27] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:59:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 12:59:28] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:59:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:59:28] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:59:28] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:59:28] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 295 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F p3)]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22454 reset in 283 ms.
Product exploration explored 100000 steps with 22404 reset in 198 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 143/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-06-01 12:59:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:59:29] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 12:59:29] [INFO ] Invariant cache hit.
[2024-06-01 12:59:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 12:59:29] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-01 12:59:29] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 12:59:29] [INFO ] Invariant cache hit.
[2024-06-01 12:59:29] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 183 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/248 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 12:59:39] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:59:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:59:40] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 328 constraints, problems are : Problem set: 0 solved, 142 unsolved in 12439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
After SMT, in 18773ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 18775ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19211 ms. Remains : 105/105 places, 143/143 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 131258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 124 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 124 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 124 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 112 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 112 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 112 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 105 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 105 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 105 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 102 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 102 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 99 transition count 127
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 99 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 97 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 94 transition count 121
Applied a total of 95 rules in 13 ms. Remains 94 /137 variables (removed 43) and now considering 121/256 (removed 135) transitions.
// Phase 1: matrix 121 rows 94 cols
[2024-06-01 12:59:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:59:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:59:48] [INFO ] Invariant cache hit.
[2024-06-01 12:59:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:59:49] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 12:59:49] [INFO ] Invariant cache hit.
[2024-06-01 12:59:49] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 11984ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 11986ms
Starting structural reductions in LI_LTL mode, iteration 1 : 94/137 places, 121/256 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12376 ms. Remains : 94/137 places, 121/256 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
Product exploration explored 100000 steps with 24418 reset in 146 ms.
Product exploration explored 100000 steps with 24375 reset in 160 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 308 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 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8935 resets) in 366 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1950 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1840 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1910405 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :3 out of 4
Probabilistic random walk after 1910405 steps, saw 841175 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :3
[2024-06-01 13:00:05] [INFO ] Invariant cache hit.
[2024-06-01 13:00:05] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:00:05] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/178 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 215/215 variables, and 144 constraints, problems are : Problem set: 1 solved, 0 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 45/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 197ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:00:05] [INFO ] Invariant cache hit.
[2024-06-01 13:00:06] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 13:00:06] [INFO ] Invariant cache hit.
[2024-06-01 13:00:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 13:00:06] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 13:00:06] [INFO ] Invariant cache hit.
[2024-06-01 13:00:06] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 15916ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15918ms
Finished structural reductions in LTL mode , in 1 iterations and 16277 ms. Remains : 94/94 places, 121/121 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 308 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 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8960 resets) in 338 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1943 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9202 steps, run visited all 2 properties in 44 ms. (steps per millisecond=209 )
Probabilistic random walk after 9202 steps, saw 4534 distinct states, run finished after 49 ms. (steps per millisecond=187 ) properties seen :2
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 282 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 24470 reset in 265 ms.
Product exploration explored 100000 steps with 24463 reset in 285 ms.
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:00:24] [INFO ] Invariant cache hit.
[2024-06-01 13:00:25] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 13:00:25] [INFO ] Invariant cache hit.
[2024-06-01 13:00:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 13:00:25] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 13:00:25] [INFO ] Invariant cache hit.
[2024-06-01 13:00:25] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 13:00:34] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 16288ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 16291ms
Finished structural reductions in LTL mode , in 1 iterations and 16878 ms. Remains : 94/94 places, 121/121 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 finished in 53341 ms.
[2024-06-01 13:00:41] [INFO ] Flatten gal took : 21 ms
[2024-06-01 13:00:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 13:00:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 256 transitions and 1008 arcs took 5 ms.
Total runtime 1089934 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717247140664

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
ltl formula formula --ltl=/tmp/3399/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 137 places, 256 transitions and 1008 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3399/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3399/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3399/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3399/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 138 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 138, there are 267 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~274 levels ~10000 states ~31312 transitions
pnml2lts-mc( 2/ 4): ~409 levels ~20000 states ~61916 transitions
pnml2lts-mc( 2/ 4): ~531 levels ~40000 states ~122012 transitions
pnml2lts-mc( 2/ 4): ~653 levels ~80000 states ~241648 transitions
pnml2lts-mc( 2/ 4): ~884 levels ~160000 states ~481084 transitions
pnml2lts-mc( 3/ 4): ~1658 levels ~320000 states ~910320 transitions
pnml2lts-mc( 3/ 4): ~2722 levels ~640000 states ~1814408 transitions
pnml2lts-mc( 3/ 4): ~4994 levels ~1280000 states ~3720048 transitions
pnml2lts-mc( 3/ 4): ~6600 levels ~2560000 states ~7521864 transitions
pnml2lts-mc( 3/ 4): ~6691 levels ~5120000 states ~15115276 transitions
pnml2lts-mc( 3/ 4): ~6756 levels ~10240000 states ~30329404 transitions
pnml2lts-mc( 3/ 4): ~6834 levels ~20480000 states ~60790632 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33391316
pnml2lts-mc( 0/ 4): unique states count: 33421456
pnml2lts-mc( 0/ 4): unique transitions count: 101144779
pnml2lts-mc( 0/ 4): - self-loop count: 58673634
pnml2lts-mc( 0/ 4): - claim dead count: 8897842
pnml2lts-mc( 0/ 4): - claim found count: 2685
pnml2lts-mc( 0/ 4): - claim success count: 33421503
pnml2lts-mc( 0/ 4): - cum. max stack depth: 29923
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33421503 states 101144956 transitions, fanout: 3.026
pnml2lts-mc( 0/ 4): Total exploration time 142.490 sec (142.370 sec minimum, 142.420 sec on average)
pnml2lts-mc( 0/ 4): States per second: 234553, Transitions per second: 709839
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 277.7MB, 8.7 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/33.0%
pnml2lts-mc( 0/ 4): Stored 259 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 277.7MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
ltl formula formula --ltl=/tmp/3399/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 137 places, 256 transitions and 1008 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3399/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3399/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3399/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3399/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 138 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 138, there are 272 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~92 levels ~10000 states ~30028 transitions
pnml2lts-mc( 3/ 4): ~92 levels ~20000 states ~59740 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~40000 states ~119896 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~80000 states ~239212 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~160000 states ~479000 transitions
pnml2lts-mc( 1/ 4): ~292 levels ~320000 states ~987808 transitions
pnml2lts-mc( 1/ 4): ~344 levels ~640000 states ~1982636 transitions
pnml2lts-mc( 1/ 4): ~396 levels ~1280000 states ~3985692 transitions
pnml2lts-mc( 1/ 4): ~448 levels ~2560000 states ~8018004 transitions
pnml2lts-mc( 1/ 4): ~552 levels ~5120000 states ~16056844 transitions
pnml2lts-mc( 1/ 4): ~656 levels ~10240000 states ~32241420 transitions
pnml2lts-mc( 2/ 4): ~669 levels ~20480000 states ~63281680 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22506723
pnml2lts-mc( 0/ 4): unique states count: 24033474
pnml2lts-mc( 0/ 4): unique transitions count: 82029255
pnml2lts-mc( 0/ 4): - self-loop count: 38906728
pnml2lts-mc( 0/ 4): - claim dead count: 8001063
pnml2lts-mc( 0/ 4): - claim found count: 825455
pnml2lts-mc( 0/ 4): - claim success count: 24033576
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1426335
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24033640 states 82030198 transitions, fanout: 3.413
pnml2lts-mc( 0/ 4): Total exploration time 106.780 sec (106.720 sec minimum, 106.753 sec on average)
pnml2lts-mc( 0/ 4): States per second: 225076, Transitions per second: 768217
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 279.5MB, 8.7 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/36.0%
pnml2lts-mc( 0/ 4): Stored 259 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 279.5MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
ltl formula formula --ltl=/tmp/3399/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 137 places, 256 transitions and 1008 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3399/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3399/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3399/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3399/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 138 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 138, there are 275 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~136 levels ~10000 states ~29848 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~20000 states ~58880 transitions
pnml2lts-mc( 3/ 4): ~179 levels ~40000 states ~119112 transitions
pnml2lts-mc( 3/ 4): ~179 levels ~80000 states ~239088 transitions
pnml2lts-mc( 3/ 4): ~223 levels ~160000 states ~480580 transitions
pnml2lts-mc( 3/ 4): ~267 levels ~320000 states ~966344 transitions
pnml2lts-mc( 1/ 4): ~4229 levels ~640000 states ~1861304 transitions
pnml2lts-mc( 1/ 4): ~4716 levels ~1280000 states ~3812080 transitions
pnml2lts-mc( 1/ 4): ~5259 levels ~2560000 states ~7661628 transitions
pnml2lts-mc( 1/ 4): ~5259 levels ~5120000 states ~15352808 transitions
pnml2lts-mc( 1/ 4): ~5259 levels ~10240000 states ~30753192 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11221230
pnml2lts-mc( 0/ 4): unique states count: 11239578
pnml2lts-mc( 0/ 4): unique transitions count: 34107337
pnml2lts-mc( 0/ 4): - self-loop count: 19497440
pnml2lts-mc( 0/ 4): - claim dead count: 3288431
pnml2lts-mc( 0/ 4): - claim found count: 900
pnml2lts-mc( 0/ 4): - claim success count: 11239715
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18721
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11239723 states 34108086 transitions, fanout: 3.035
pnml2lts-mc( 0/ 4): Total exploration time 47.360 sec (47.310 sec minimum, 47.323 sec on average)
pnml2lts-mc( 0/ 4): States per second: 237325, Transitions per second: 720188
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 150.3MB, 13.9 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 33.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 259 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 150.3MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
ltl formula formula --ltl=/tmp/3399/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 137 places, 256 transitions and 1008 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3399/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3399/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3399/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3399/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 138 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 138, there are 270 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~143!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3763
pnml2lts-mc( 0/ 4): unique states count: 4264
pnml2lts-mc( 0/ 4): unique transitions count: 13123
pnml2lts-mc( 0/ 4): - self-loop count: 6216
pnml2lts-mc( 0/ 4): - claim dead count: 995
pnml2lts-mc( 0/ 4): - claim found count: 27
pnml2lts-mc( 0/ 4): - claim success count: 4371
pnml2lts-mc( 0/ 4): - cum. max stack depth: 561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4372 states 13573 transitions, fanout: 3.105
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 72867, Transitions per second: 226217
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 12.2 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 259 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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-d1m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m96, 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 r532-smll-171683810700092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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