About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d2m18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7912.495 | 1437589.00 | 2397440.00 | 3236.70 | FF?FF?FFTFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809700116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d2m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809700116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 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 1.1M 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-d2m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716916036391
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:07:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 17:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:07:18] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-28 17:07:18] [INFO ] Transformed 2398 places.
[2024-05-28 17:07:18] [INFO ] Transformed 1954 transitions.
[2024-05-28 17:07:18] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 954 place count 288 transition count 647
Iterating global reduction 1 with 101 rules applied. Total rules applied 1055 place count 288 transition count 647
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1065 place count 288 transition count 637
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1139 place count 214 transition count 563
Iterating global reduction 2 with 74 rules applied. Total rules applied 1213 place count 214 transition count 563
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1252 place count 214 transition count 524
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1277 place count 189 transition count 495
Iterating global reduction 3 with 25 rules applied. Total rules applied 1302 place count 189 transition count 495
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 3 with 73 rules applied. Total rules applied 1375 place count 189 transition count 422
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1381 place count 183 transition count 412
Iterating global reduction 4 with 6 rules applied. Total rules applied 1387 place count 183 transition count 412
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1393 place count 177 transition count 406
Iterating global reduction 4 with 6 rules applied. Total rules applied 1399 place count 177 transition count 406
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1402 place count 174 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 1405 place count 174 transition count 402
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1407 place count 172 transition count 400
Iterating global reduction 4 with 2 rules applied. Total rules applied 1409 place count 172 transition count 400
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1411 place count 170 transition count 398
Iterating global reduction 4 with 2 rules applied. Total rules applied 1413 place count 170 transition count 398
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1414 place count 169 transition count 397
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 169 transition count 397
Applied a total of 1415 rules in 201 ms. Remains 169 /414 variables (removed 245) and now considering 397/1954 (removed 1557) transitions.
// Phase 1: matrix 397 rows 169 cols
[2024-05-28 17:07:19] [INFO ] Computed 5 invariants in 32 ms
[2024-05-28 17:07:19] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-28 17:07:19] [INFO ] Invariant cache hit.
[2024-05-28 17:07:20] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-28 17:07:20] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-28 17:07:21] [INFO ] Invariant cache hit.
[2024-05-28 17:07:21] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-28 17:07:26] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 1/169 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-28 17:07:32] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 3 ms to minimize.
[2024-05-28 17:07:32] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 397/566 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 267/444 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 444 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 1/169 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 397/566 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 267/444 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 396/840 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-28 17:08:12] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:08:13] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:08:13] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 843 constraints, problems are : Problem set: 2 solved, 394 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 6/6 constraints]
After SMT, in 61602ms problems are : Problem set: 2 solved, 394 unsolved
Search for dead transitions found 2 dead transitions in 61647ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/414 places, 395/1954 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 167 transition count 395
Applied a total of 2 rules in 6 ms. Remains 167 /169 variables (removed 2) and now considering 395/395 (removed 0) transitions.
// Phase 1: matrix 395 rows 167 cols
[2024-05-28 17:08:22] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:08:22] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 17:08:22] [INFO ] Invariant cache hit.
[2024-05-28 17:08:23] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-28 17:08:23] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 167/414 places, 395/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64826 ms. Remains : 167/414 places, 395/1954 transitions.
Support contains 23 out of 167 places after structural reductions.
[2024-05-28 17:08:24] [INFO ] Flatten gal took : 82 ms
[2024-05-28 17:08:24] [INFO ] Flatten gal took : 41 ms
[2024-05-28 17:08:24] [INFO ] Input system was already deterministic with 395 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (8990 resets) in 4463 ms. (8 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (193 resets) in 119 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (168 resets) in 69 ms. (57 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (192 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (186 resets) in 97 ms. (40 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (183 resets) in 99 ms. (40 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (179 resets) in 79 ms. (50 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (195 resets) in 80 ms. (49 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (185 resets) in 67 ms. (58 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (190 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (216 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (186 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (199 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (190 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (193 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (176 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (200 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (195 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (166 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (218 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (188 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (180 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (195 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 199417 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :13 out of 24
Probabilistic random walk after 199417 steps, saw 91866 distinct states, run finished after 3014 ms. (steps per millisecond=66 ) properties seen :13
[2024-05-28 17:08:29] [INFO ] Invariant cache hit.
[2024-05-28 17:08:29] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 33/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 269/397 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 140/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 165/562 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 126/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/562 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 437 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 33/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 269/397 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 140/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 165/562 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 126/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 11/448 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-28 17:08:32] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/562 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/562 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 449 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3675 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 5215ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 31210 ms.
Support contains 13 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 395/395 transitions.
Graph (complete) has 658 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 166 transition count 393
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 158 transition count 289
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 158 transition count 289
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 150 transition count 281
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 150 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 41 place count 150 transition count 275
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 146 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 146 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 146 transition count 265
Applied a total of 51 rules in 70 ms. Remains 146 /167 variables (removed 21) and now considering 265/395 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 146/167 places, 265/395 transitions.
RANDOM walk for 40000 steps (8982 resets) in 365 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1861 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1817 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1868 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1876 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1858 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 244807 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :1 out of 11
Probabilistic random walk after 244807 steps, saw 107650 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :1
// Phase 1: matrix 265 rows 146 cols
[2024-05-28 17:09:09] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 17:09:09] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 74/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 232/322 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 125/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 89/411 variables, 56/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 33/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/411 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 307 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1057 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 146/146 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 74/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 232/322 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 125/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 89/411 variables, 56/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 33/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 10/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 17:09:11] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 17:09:11] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/411 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 319 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 146/146 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 3664ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 25075 ms.
Support contains 12 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 265/265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 144 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 144 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 143 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 143 transition count 248
Applied a total of 7 rules in 30 ms. Remains 143 /146 variables (removed 3) and now considering 248/265 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 143/146 places, 248/265 transitions.
RANDOM walk for 40000 steps (8991 resets) in 286 ms. (139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1889 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1946 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1874 resets) in 108 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1861 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 210754 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 10
Probabilistic random walk after 210754 steps, saw 92380 distinct states, run finished after 3005 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 248 rows 143 cols
[2024-05-28 17:09:42] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 17:09:42] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 73/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 228/317 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 74/391 variables, 54/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 290 constraints, problems are : Problem set: 0 solved, 10 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 73/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 228/317 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 74/391 variables, 54/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 10/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 17:09:44] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 17:09:44] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 302 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3079 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 4114ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 23636 ms.
Support contains 12 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 248/248 transitions.
Applied a total of 0 rules in 13 ms. Remains 143 /143 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 143/143 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 248/248 transitions.
Applied a total of 0 rules in 14 ms. Remains 143 /143 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-28 17:10:09] [INFO ] Invariant cache hit.
[2024-05-28 17:10:09] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 17:10:09] [INFO ] Invariant cache hit.
[2024-05-28 17:10:10] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-28 17:10:10] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2024-05-28 17:10:10] [INFO ] Redundant transitions in 13 ms returned []
Running 247 sub problems to find dead transitions.
[2024-05-28 17:10:10] [INFO ] Invariant cache hit.
[2024-05-28 17:10:10] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 4 (OVERLAPS) 248/391 variables, 143/146 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 144/290 constraints. Problems are: Problem set: 3 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 290 constraints, problems are : Problem set: 3 solved, 244 unsolved in 15975 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 247/387 variables, 140/143 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 143/286 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 22/308 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 4/391 variables, 3/311 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 1/312 constraints. Problems are: Problem set: 3 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 222/534 constraints. Problems are: Problem set: 3 solved, 244 unsolved
[2024-05-28 17:10:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:10:51] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 536 constraints, problems are : Problem set: 3 solved, 244 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 244/247 constraints, Known Traps: 2/2 constraints]
After SMT, in 46483ms problems are : Problem set: 3 solved, 244 unsolved
Search for dead transitions found 3 dead transitions in 46488ms
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 REACHABILITY mode, iteration 1 : 143/143 places, 245/248 transitions.
Graph (complete) has 476 edges and 143 vertex of which 140 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 140 /143 variables (removed 3) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 140 cols
[2024-05-28 17:10:57] [INFO ] Computed 3 invariants in 9 ms
[2024-05-28 17:10:57] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-28 17:10:57] [INFO ] Invariant cache hit.
[2024-05-28 17:10:57] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-28 17:10:57] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/143 places, 245/248 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48217 ms. Remains : 140/143 places, 245/248 transitions.
Computed a total of 34 stabilizing places and 59 stable transitions
Graph (complete) has 717 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 218
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 150 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 133 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 133 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 74 place count 133 transition count 194
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 120 transition count 172
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 120 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 120 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 117 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 117 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 114 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 114 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 113 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 112 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 111 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 111 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 110 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 110 transition count 151
Applied a total of 129 rules in 49 ms. Remains 110 /167 variables (removed 57) and now considering 151/395 (removed 244) transitions.
// Phase 1: matrix 151 rows 110 cols
[2024-05-28 17:10:58] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:10:58] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 17:10:58] [INFO ] Invariant cache hit.
[2024-05-28 17:10:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 17:10:58] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-28 17:10:58] [INFO ] Redundant transitions in 2 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-28 17:10:58] [INFO ] Invariant cache hit.
[2024-05-28 17:10:58] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-28 17:11:00] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:11:00] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-28 17:11:01] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-05-28 17:11:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 7 (OVERLAPS) 151/261 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 74/192 constraints. Problems are: Problem set: 3 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 192 constraints, problems are : Problem set: 3 solved, 147 unsolved in 6747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 150/258 variables, 108/116 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 73/189 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 28/217 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 13 (OVERLAPS) 3/261 variables, 2/219 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 119/339 constraints. Problems are: Problem set: 3 solved, 147 unsolved
[2024-05-28 17:11:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/261 variables, 1/340 constraints. Problems are: Problem set: 4 solved, 146 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/261 variables, 0/340 constraints. Problems are: Problem set: 4 solved, 146 unsolved
At refinement iteration 18 (OVERLAPS) 0/261 variables, 0/340 constraints. Problems are: Problem set: 4 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 340 constraints, problems are : Problem set: 4 solved, 146 unsolved in 23252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 147/150 constraints, Known Traps: 5/5 constraints]
After SMT, in 30197ms problems are : Problem set: 4 solved, 146 unsolved
Search for dead transitions found 4 dead transitions in 30199ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/167 places, 147/395 transitions.
Graph (complete) has 363 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 106 /110 variables (removed 4) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-05-28 17:11:29] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:11:29] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 17:11:29] [INFO ] Invariant cache hit.
[2024-05-28 17:11:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:11:29] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/167 places, 147/395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31572 ms. Remains : 106/167 places, 147/395 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 finished in 32008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U G(p2))&&p0))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 220
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 219
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 202
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 135 transition count 196
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 84 place count 122 transition count 173
Iterating global reduction 2 with 13 rules applied. Total rules applied 97 place count 122 transition count 173
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 106 place count 122 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 118 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 118 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 115 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 114 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 114 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 113 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 113 transition count 152
Applied a total of 127 rules in 48 ms. Remains 113 /167 variables (removed 54) and now considering 152/395 (removed 243) transitions.
// Phase 1: matrix 152 rows 113 cols
[2024-05-28 17:11:30] [INFO ] Computed 4 invariants in 37 ms
[2024-05-28 17:11:30] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-28 17:11:30] [INFO ] Invariant cache hit.
[2024-05-28 17:11:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:11:30] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-28 17:11:30] [INFO ] Redundant transitions in 6 ms returned []
Running 151 sub problems to find dead transitions.
[2024-05-28 17:11:30] [INFO ] Invariant cache hit.
[2024-05-28 17:11:30] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-28 17:11:33] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:11:33] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 21 ms to minimize.
[2024-05-28 17:11:33] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD136 is UNSAT
At refinement iteration 6 (OVERLAPS) 152/265 variables, 113/120 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 73/193 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 148 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 193 constraints, problems are : Problem set: 3 solved, 148 unsolved in 10700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 151/262 variables, 111/118 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 72/190 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 30/220 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 3/265 variables, 2/222 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/223 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 118/341 constraints. Problems are: Problem set: 3 solved, 148 unsolved
[2024-05-28 17:11:52] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 17:11:52] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 2/343 constraints. Problems are: Problem set: 4 solved, 147 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/343 constraints. Problems are: Problem set: 4 solved, 147 unsolved
At refinement iteration 18 (OVERLAPS) 0/265 variables, 0/343 constraints. Problems are: Problem set: 4 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 343 constraints, problems are : Problem set: 4 solved, 147 unsolved in 21927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 148/151 constraints, Known Traps: 5/5 constraints]
After SMT, in 32954ms problems are : Problem set: 4 solved, 147 unsolved
Search for dead transitions found 4 dead transitions in 32957ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/167 places, 148/395 transitions.
Graph (complete) has 371 edges and 113 vertex of which 109 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 109 /113 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 109 cols
[2024-05-28 17:12:03] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:12:04] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 17:12:04] [INFO ] Invariant cache hit.
[2024-05-28 17:12:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 17:12:04] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/167 places, 148/395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34312 ms. Remains : 109/167 places, 148/395 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 finished in 34554 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||G(!p0))) U ((G(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p3)))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 218
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 150 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 133 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 133 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 133 transition count 193
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 120 transition count 171
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 120 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 114 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 114 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 113 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 110 transition count 150
Applied a total of 130 rules in 55 ms. Remains 110 /167 variables (removed 57) and now considering 150/395 (removed 245) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-28 17:12:04] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:12:05] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-28 17:12:05] [INFO ] Invariant cache hit.
[2024-05-28 17:12:05] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 17:12:05] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2024-05-28 17:12:05] [INFO ] Redundant transitions in 2 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-28 17:12:05] [INFO ] Invariant cache hit.
[2024-05-28 17:12:05] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:12:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:12:08] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:12:09] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:12:10] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 9 (OVERLAPS) 150/260 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 74/192 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 192 constraints, problems are : Problem set: 3 solved, 146 unsolved in 10788 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 149/257 variables, 108/116 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 73/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 28/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 2/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 118/338 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 17:12:27] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 1/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 339 constraints, problems are : Problem set: 4 solved, 145 unsolved in 25467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 5/5 constraints]
After SMT, in 36519ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 36522ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/167 places, 146/395 transitions.
Graph (complete) has 362 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 17:12:42] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:12:42] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 17:12:42] [INFO ] Invariant cache hit.
[2024-05-28 17:12:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:12:42] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/167 places, 146/395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37811 ms. Remains : 106/167 places, 146/395 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3) p0), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
Product exploration explored 100000 steps with 22482 reset in 564 ms.
Product exploration explored 100000 steps with 22530 reset in 429 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 236 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 3 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3) p0), (AND p0 (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (9001 resets) in 286 ms. (139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1904 resets) in 596 ms. (67 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1861 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1874 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1869 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1865 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 185213 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :3 out of 10
Probabilistic random walk after 185213 steps, saw 85822 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :3
[2024-05-28 17:12:48] [INFO ] Invariant cache hit.
[2024-05-28 17:12:48] [INFO ] State equation strengthened by 73 read => feed constraints.
Problem apf5 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 127/205 variables, 78/82 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 54/136 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 47/252 variables, 28/164 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 19/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 2 solved, 5 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 17:12:48] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/56 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 22/78 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 127/205 variables, 78/83 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 54/137 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 47/252 variables, 28/165 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 19/184 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 5/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/252 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 189 constraints, problems are : Problem set: 2 solved, 5 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1008ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2059 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 321 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 144
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 144/146 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/106 places, 144/146 transitions.
RANDOM walk for 40000 steps (8993 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1913 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1838 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1907 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1956 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 270149 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 5
Probabilistic random walk after 270149 steps, saw 125076 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 144 rows 105 cols
[2024-05-28 17:12:54] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:12:54] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 5 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 184 constraints, problems are : Problem set: 0 solved, 5 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 940ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1691 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-28 17:12:57] [INFO ] Invariant cache hit.
[2024-05-28 17:12:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 17:12:57] [INFO ] Invariant cache hit.
[2024-05-28 17:12:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-28 17:12:57] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-28 17:12:57] [INFO ] Redundant transitions in 0 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-28 17:12:57] [INFO ] Invariant cache hit.
[2024-05-28 17:12:57] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 143/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 322 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12413 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 18494ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 18497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18970 ms. Remains : 105/105 places, 144/144 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 105 transition count 137
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 137
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 99 transition count 122
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 84 transition count 122
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 57 place count 77 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 76 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 76 transition count 125
Applied a total of 60 rules in 21 ms. Remains 76 /105 variables (removed 29) and now considering 125/144 (removed 19) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 125 rows 76 cols
[2024-05-28 17:13:16] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 17:13:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 17:13:16] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 17:13:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 17:13:16] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-28 17:13:17] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-28 17:13:17] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1013 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (G (OR p1 p2 p3 (NOT p0))), (G (OR p1 p2 p3 p0))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (F p3), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 402 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p3) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 17:13:17] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:13:17] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 17:13:17] [INFO ] Invariant cache hit.
[2024-05-28 17:13:17] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:13:18] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-28 17:13:18] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-28 17:13:18] [INFO ] Invariant cache hit.
[2024-05-28 17:13:18] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/252 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 73/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 145 unsolved in 6033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 17:13:25] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/252 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 73/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 145/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 329 constraints, problems are : Problem set: 0 solved, 145 unsolved in 15449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 1/1 constraints]
After SMT, in 21653ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 21656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22085 ms. Remains : 106/106 places, 146/146 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND p0 (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (8998 resets) in 676 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1924 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1936 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1838 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 472518 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :3 out of 5
Probabilistic random walk after 472518 steps, saw 215313 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :3
[2024-05-28 17:13:43] [INFO ] Invariant cache hit.
[2024-05-28 17:13:43] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 127/205 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/252 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 19/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 127/205 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/252 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 19/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 906ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1304 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 321 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 144
Applied a total of 3 rules in 18 ms. Remains 105 /106 variables (removed 1) and now considering 144/146 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 105/106 places, 144/146 transitions.
RANDOM walk for 40000 steps (9036 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1857 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 443169 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 2
Probabilistic random walk after 443169 steps, saw 202950 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
// Phase 1: matrix 144 rows 105 cols
[2024-05-28 17:13:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:13:49] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1712 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-28 17:13:51] [INFO ] Invariant cache hit.
[2024-05-28 17:13:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 17:13:51] [INFO ] Invariant cache hit.
[2024-05-28 17:13:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-28 17:13:52] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2024-05-28 17:13:52] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-28 17:13:52] [INFO ] Invariant cache hit.
[2024-05-28 17:13:52] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6434 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 143/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 322 constraints, problems are : Problem set: 0 solved, 143 unsolved in 14269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 20962ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 20966ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21627 ms. Remains : 105/105 places, 144/144 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 105 transition count 137
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 137
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 99 transition count 122
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 84 transition count 122
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 57 place count 77 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 76 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 76 transition count 125
Applied a total of 60 rules in 11 ms. Remains 76 /105 variables (removed 29) and now considering 125/144 (removed 19) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 76 cols
[2024-05-28 17:14:13] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 17:14:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 17:14:13] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 17:14:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 17:14:13] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 17:14:13] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 17:14:13] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 483 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p3), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1))))]
Knowledge based reduction with 11 factoid took 338 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND p0 (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 22499 reset in 212 ms.
Product exploration explored 100000 steps with 22537 reset in 200 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 17:14:14] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:14:14] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-28 17:14:14] [INFO ] Invariant cache hit.
[2024-05-28 17:14:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:14:15] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-28 17:14:15] [INFO ] Redundant transitions in 0 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-28 17:14:15] [INFO ] Invariant cache hit.
[2024-05-28 17:14:15] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/252 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 73/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 145 unsolved in 6466 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 17:14:23] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/252 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 73/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 145/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 329 constraints, problems are : Problem set: 0 solved, 145 unsolved in 13998 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 1/1 constraints]
After SMT, in 20661ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 20663ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21246 ms. Remains : 106/106 places, 146/146 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 finished in 151245 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)&&X((F(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 218
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 150 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 133 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 133 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 133 transition count 193
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 120 transition count 171
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 120 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 114 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 114 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 113 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 110 transition count 150
Applied a total of 130 rules in 19 ms. Remains 110 /167 variables (removed 57) and now considering 150/395 (removed 245) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-28 17:14:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:14:36] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 17:14:36] [INFO ] Invariant cache hit.
[2024-05-28 17:14:36] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 17:14:36] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-28 17:14:36] [INFO ] Invariant cache hit.
[2024-05-28 17:14:36] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:14:39] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:14:39] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:14:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:14:41] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 9 (OVERLAPS) 150/260 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 74/192 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 192 constraints, problems are : Problem set: 3 solved, 146 unsolved in 12511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 149/257 variables, 108/116 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 73/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 28/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 2/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 118/338 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 17:15:01] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 1/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 339 constraints, problems are : Problem set: 4 solved, 145 unsolved in 28764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 5/5 constraints]
After SMT, in 41565ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 41569ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/167 places, 146/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 17:15:18] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:15:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 17:15:18] [INFO ] Invariant cache hit.
[2024-05-28 17:15:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:15:18] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/167 places, 146/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42720 ms. Remains : 106/167 places, 146/395 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3) p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 finished in 42975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 206
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 206
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 133 transition count 189
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 133 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 133 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 88 place count 120 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 101 place count 120 transition count 159
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 120 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 117 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 117 transition count 146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 114 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 114 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 113 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 113 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 113 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 112 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 112 transition count 139
Applied a total of 129 rules in 18 ms. Remains 112 /167 variables (removed 55) and now considering 139/395 (removed 256) transitions.
// Phase 1: matrix 139 rows 112 cols
[2024-05-28 17:15:19] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:15:19] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 17:15:19] [INFO ] Invariant cache hit.
[2024-05-28 17:15:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 17:15:19] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-28 17:15:19] [INFO ] Invariant cache hit.
[2024-05-28 17:15:19] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:15:22] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:15:22] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:15:22] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:15:23] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 8 (OVERLAPS) 139/251 variables, 112/120 constraints. Problems are: Problem set: 3 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 61/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 181 constraints, problems are : Problem set: 3 solved, 135 unsolved in 8948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 138/248 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 29/207 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 3/251 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 106/316 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 17:15:41] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:15:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 2/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/251 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
At refinement iteration 18 (OVERLAPS) 0/251 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 318 constraints, problems are : Problem set: 4 solved, 134 unsolved in 29764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/138 constraints, Known Traps: 6/6 constraints]
After SMT, in 39060ms problems are : Problem set: 4 solved, 134 unsolved
Search for dead transitions found 4 dead transitions in 39063ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/167 places, 135/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 135
Applied a total of 4 rules in 2 ms. Remains 108 /112 variables (removed 4) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 17:15:58] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:15:58] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 17:15:58] [INFO ] Invariant cache hit.
[2024-05-28 17:15:58] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 17:15:59] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/167 places, 135/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40087 ms. Remains : 108/167 places, 135/395 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
Product exploration explored 100000 steps with 22445 reset in 526 ms.
Product exploration explored 100000 steps with 22387 reset in 283 ms.
Computed a total of 23 stabilizing places and 30 stable transitions
Graph (complete) has 353 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 23 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8915 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1607196 steps, run timeout after 3001 ms. (steps per millisecond=535 ) properties seen :0 out of 1
Probabilistic random walk after 1607196 steps, saw 694639 distinct states, run finished after 3001 ms. (steps per millisecond=535 ) properties seen :0
[2024-05-28 17:16:03] [INFO ] Invariant cache hit.
[2024-05-28 17:16:03] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
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) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/243 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 172 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: 108/108 constraints, ReadFeed: 60/60 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/243 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 242 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Graph (complete) has 316 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 133
Applied a total of 3 rules in 7 ms. Remains 107 /108 variables (removed 1) and now considering 133/135 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/108 places, 133/135 transitions.
RANDOM walk for 40000 steps (8935 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1721318 steps, run timeout after 3001 ms. (steps per millisecond=573 ) properties seen :0 out of 1
Probabilistic random walk after 1721318 steps, saw 742745 distinct states, run finished after 3001 ms. (steps per millisecond=573 ) properties seen :0
// Phase 1: matrix 133 rows 107 cols
[2024-05-28 17:16:07] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:16:07] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
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) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/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) 116/182 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/240 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/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) 116/182 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/240 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 107/107 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-28 17:16:07] [INFO ] Invariant cache hit.
[2024-05-28 17:16:07] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 17:16:07] [INFO ] Invariant cache hit.
[2024-05-28 17:16:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 17:16:08] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-28 17:16:08] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-28 17:16:08] [INFO ] Invariant cache hit.
[2024-05-28 17:16:08] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/240 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 58/168 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-28 17:16:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/240 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 169 constraints, problems are : Problem set: 3 solved, 129 unsolved in 9789 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 4/107 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 133/240 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 58/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 129/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 298 constraints, problems are : Problem set: 3 solved, 129 unsolved in 12935 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 1/1 constraints]
After SMT, in 22953ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 22956ms
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 REACHABILITY mode, iteration 1 : 107/107 places, 130/133 transitions.
Graph (complete) has 307 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 104 /107 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 17:16:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 17:16:31] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 17:16:31] [INFO ] Invariant cache hit.
[2024-05-28 17:16:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 17:16:31] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/107 places, 130/133 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24083 ms. Remains : 104/107 places, 130/133 transitions.
RANDOM walk for 40000 steps (9012 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1905 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1711963 steps, run timeout after 3001 ms. (steps per millisecond=570 ) properties seen :0 out of 1
Probabilistic random walk after 1711963 steps, saw 738617 distinct states, run finished after 3001 ms. (steps per millisecond=570 ) properties seen :0
[2024-05-28 17:16:34] [INFO ] Invariant cache hit.
[2024-05-28 17:16:34] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
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) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:16:35] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 157 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 17:16:35] [INFO ] Invariant cache hit.
[2024-05-28 17:16:35] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 17:16:35] [INFO ] Invariant cache hit.
[2024-05-28 17:16:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 17:16:36] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-28 17:16:36] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 17:16:36] [INFO ] Invariant cache hit.
[2024-05-28 17:16:36] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6487 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 17:16:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 13945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 20658ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 20661ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21290 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 104 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 123
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 98 transition count 107
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 82 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 76 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 110
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 75 transition count 110
Applied a total of 61 rules in 17 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 17:16:56] [INFO ] Computed 2 invariants in 3 ms
[2024-05-28 17:16:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 17:16:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:16:57] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:16:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 17:16:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:16:57] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 17:16:57] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:16:57] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 17:16:57] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:16:57] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-28 17:16:57] [INFO ] Invariant cache hit.
[2024-05-28 17:16:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 17:16:58] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-28 17:16:58] [INFO ] Invariant cache hit.
[2024-05-28 17:16:58] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 60/172 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 17:17:03] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/243 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 173 constraints, problems are : Problem set: 3 solved, 131 unsolved in 8756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 4/108 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 60/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 131/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 304 constraints, problems are : Problem set: 3 solved, 131 unsolved in 11750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 1/1 constraints]
After SMT, in 20728ms problems are : Problem set: 3 solved, 131 unsolved
Search for dead transitions found 3 dead transitions in 20731ms
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 : 108/108 places, 132/135 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 132
Applied a total of 3 rules in 2 ms. Remains 105 /108 variables (removed 3) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 105 cols
[2024-05-28 17:17:18] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 17:17:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 17:17:19] [INFO ] Invariant cache hit.
[2024-05-28 17:17:19] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 17:17:19] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/108 places, 132/135 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22000 ms. Remains : 105/108 places, 132/135 transitions.
Computed a total of 20 stabilizing places and 27 stable transitions
Graph (complete) has 343 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 20 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9018 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1541158 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :0 out of 1
Probabilistic random walk after 1541158 steps, saw 665663 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
[2024-05-28 17:17:22] [INFO ] Invariant cache hit.
[2024-05-28 17:17:22] [INFO ] State equation strengthened by 59 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) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/237 variables, 31/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/237 variables, 31/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/237 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 132/132 transitions.
Graph (complete) has 307 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 130
Applied a total of 3 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/105 places, 130/132 transitions.
RANDOM walk for 40000 steps (9052 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1592582 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 1
Probabilistic random walk after 1592582 steps, saw 687364 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 17:17:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 17:17:26] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
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) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:17:26] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 17:17:27] [INFO ] Invariant cache hit.
[2024-05-28 17:17:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 17:17:27] [INFO ] Invariant cache hit.
[2024-05-28 17:17:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 17:17:27] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-28 17:17:27] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 17:17:27] [INFO ] Invariant cache hit.
[2024-05-28 17:17:27] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 17:17:34] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 13138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 17762ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 17763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18119 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 104 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 123
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 98 transition count 107
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 82 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 76 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 110
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 75 transition count 110
Applied a total of 61 rules in 13 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 17:17:45] [INFO ] Computed 2 invariants in 5 ms
[2024-05-28 17:17:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:45] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:17:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:45] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 17:17:45] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:17:45] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 515 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22541 reset in 263 ms.
Product exploration explored 100000 steps with 22466 reset in 276 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 132/132 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 17:17:47] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
// Phase 1: matrix 132 rows 105 cols
[2024-05-28 17:17:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:17:47] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 17:17:58] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 299 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16498 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
After SMT, in 23605ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 23608ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23633 ms. Remains : 105/105 places, 132/132 transitions.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 17:18:11] [INFO ] Invariant cache hit.
[2024-05-28 17:18:11] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-28 17:18:11] [INFO ] Invariant cache hit.
[2024-05-28 17:18:11] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 17:18:11] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-05-28 17:18:11] [INFO ] Invariant cache hit.
[2024-05-28 17:18:11] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 299 constraints, problems are : Problem set: 0 solved, 131 unsolved in 18616 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
After SMT, in 23475ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 23476ms
Finished structural reductions in LTL mode , in 1 iterations and 24066 ms. Remains : 105/105 places, 132/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 finished in 196215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 218
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 150 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 133 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 133 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 133 transition count 193
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 120 transition count 171
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 120 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 114 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 114 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 113 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 110 transition count 150
Applied a total of 130 rules in 17 ms. Remains 110 /167 variables (removed 57) and now considering 150/395 (removed 245) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-28 17:18:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:18:35] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 17:18:35] [INFO ] Invariant cache hit.
[2024-05-28 17:18:35] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 17:18:35] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-28 17:18:35] [INFO ] Invariant cache hit.
[2024-05-28 17:18:35] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/117 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 9300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 2/218 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 1/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 118/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 17:18:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 1/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 338 constraints, problems are : Problem set: 4 solved, 145 unsolved in 26116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 4/4 constraints]
After SMT, in 35596ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 35598ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/167 places, 146/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 5 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 17:19:11] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:19:11] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 17:19:11] [INFO ] Invariant cache hit.
[2024-05-28 17:19:11] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 17:19:12] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/167 places, 146/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36894 ms. Remains : 106/167 places, 146/395 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 finished in 37096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0)))) U (X(p1) U (p1||F(p2)))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 231
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 213
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 135 transition count 207
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 83 place count 123 transition count 187
Iterating global reduction 2 with 12 rules applied. Total rules applied 95 place count 123 transition count 187
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 123 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 121 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 121 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 119 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 119 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 118 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 118 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 117 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 117 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 116 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 116 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 115 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 115 transition count 169
Applied a total of 119 rules in 24 ms. Remains 115 /167 variables (removed 52) and now considering 169/395 (removed 226) transitions.
// Phase 1: matrix 169 rows 115 cols
[2024-05-28 17:19:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:19:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 17:19:12] [INFO ] Invariant cache hit.
[2024-05-28 17:19:12] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-28 17:19:13] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-28 17:19:13] [INFO ] Invariant cache hit.
[2024-05-28 17:19:13] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 17:19:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-28 17:19:16] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 17:19:17] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 17:19:18] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 8 (OVERLAPS) 169/284 variables, 115/123 constraints. Problems are: Problem set: 3 solved, 165 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 89/212 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/284 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 212 constraints, problems are : Problem set: 3 solved, 165 unsolved in 11092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 115/115 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 168/281 variables, 113/121 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 88/209 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 30/239 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 3/284 variables, 2/241 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 1/242 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 135/377 constraints. Problems are: Problem set: 3 solved, 165 unsolved
[2024-05-28 17:19:36] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/378 constraints. Problems are: Problem set: 4 solved, 164 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/378 constraints. Problems are: Problem set: 4 solved, 164 unsolved
At refinement iteration 18 (OVERLAPS) 0/284 variables, 0/378 constraints. Problems are: Problem set: 4 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 378 constraints, problems are : Problem set: 4 solved, 164 unsolved in 25296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 115/115 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 165/168 constraints, Known Traps: 5/5 constraints]
After SMT, in 36753ms problems are : Problem set: 4 solved, 164 unsolved
Search for dead transitions found 4 dead transitions in 36757ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 115/167 places, 165/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 165
Applied a total of 4 rules in 5 ms. Remains 111 /115 variables (removed 4) and now considering 165/165 (removed 0) transitions.
// Phase 1: matrix 165 rows 111 cols
[2024-05-28 17:19:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:19:49] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 17:19:49] [INFO ] Invariant cache hit.
[2024-05-28 17:19:50] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-28 17:19:50] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/167 places, 165/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38044 ms. Remains : 111/167 places, 165/395 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 finished in 38258 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' '!((p0 U (p1||X(F(p0)))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 150 transition count 206
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 133 transition count 188
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 133 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 133 transition count 182
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 120 transition count 159
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 120 transition count 159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 120 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 116 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 116 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 113 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 113 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 112 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 112 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 111 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 111 transition count 139
Applied a total of 131 rules in 12 ms. Remains 111 /167 variables (removed 56) and now considering 139/395 (removed 256) transitions.
// Phase 1: matrix 139 rows 111 cols
[2024-05-28 17:19:50] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:19:50] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 17:19:50] [INFO ] Invariant cache hit.
[2024-05-28 17:19:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 17:19:51] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-28 17:19:51] [INFO ] Invariant cache hit.
[2024-05-28 17:19:51] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:19:53] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:19:53] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:19:54] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:19:55] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 8 (OVERLAPS) 139/250 variables, 111/119 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 61/180 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 17:19:58] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 181 constraints, problems are : Problem set: 3 solved, 135 unsolved in 11340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 17:20:05] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 138/247 variables, 109/118 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 29/207 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 14 (OVERLAPS) 3/250 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 106/316 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 1/317 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 17:20:15] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 1/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
At refinement iteration 20 (OVERLAPS) 0/250 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 318 constraints, problems are : Problem set: 4 solved, 134 unsolved in 24572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/138 constraints, Known Traps: 7/7 constraints]
After SMT, in 36171ms problems are : Problem set: 4 solved, 134 unsolved
Search for dead transitions found 4 dead transitions in 36173ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/167 places, 135/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 135
Applied a total of 4 rules in 3 ms. Remains 107 /111 variables (removed 4) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 107 cols
[2024-05-28 17:20:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:20:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 17:20:27] [INFO ] Invariant cache hit.
[2024-05-28 17:20:27] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 17:20:27] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/167 places, 135/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37236 ms. Remains : 107/167 places, 135/395 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 finished in 37418 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 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 207
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 150 transition count 206
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 133 transition count 188
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 133 transition count 188
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 133 transition count 181
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 120 transition count 158
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 120 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 120 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 117 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 117 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 114 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 114 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 112 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 112 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 112 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 111 transition count 138
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 111 transition count 138
Applied a total of 131 rules in 34 ms. Remains 111 /167 variables (removed 56) and now considering 138/395 (removed 257) transitions.
// Phase 1: matrix 138 rows 111 cols
[2024-05-28 17:20:28] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 17:20:28] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-28 17:20:28] [INFO ] Invariant cache hit.
[2024-05-28 17:20:28] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 17:20:28] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-28 17:20:28] [INFO ] Redundant transitions in 1 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-28 17:20:28] [INFO ] Invariant cache hit.
[2024-05-28 17:20:28] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-28 17:20:31] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-28 17:20:32] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 7 (OVERLAPS) 138/249 variables, 111/117 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 61/178 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 178 constraints, problems are : Problem set: 3 solved, 134 unsolved in 9153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 17:20:40] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 137/246 variables, 109/116 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 60/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/205 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 3/249 variables, 2/207 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 105/313 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 17:20:50] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:20:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 2/315 constraints. Problems are: Problem set: 4 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 0/249 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 315 constraints, problems are : Problem set: 4 solved, 133 unsolved in 23353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 134/137 constraints, Known Traps: 5/5 constraints]
After SMT, in 32755ms problems are : Problem set: 4 solved, 133 unsolved
Search for dead transitions found 4 dead transitions in 32758ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/167 places, 134/395 transitions.
Graph (complete) has 354 edges and 111 vertex of which 107 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 107 /111 variables (removed 4) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 107 cols
[2024-05-28 17:21:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:21:01] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 17:21:01] [INFO ] Invariant cache hit.
[2024-05-28 17:21:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 17:21:02] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/167 places, 134/395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34047 ms. Remains : 107/167 places, 134/395 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 finished in 34112 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(((p1 U G(p2))&&p0)))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 218
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 150 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 133 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 133 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 133 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 120 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 120 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 120 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 117 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 117 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 114 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 114 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 112 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 112 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 112 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 110 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 110 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 109 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 109 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 108 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 108 transition count 144
Applied a total of 138 rules in 15 ms. Remains 108 /167 variables (removed 59) and now considering 144/395 (removed 251) transitions.
// Phase 1: matrix 144 rows 108 cols
[2024-05-28 17:21:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:21:02] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 17:21:02] [INFO ] Invariant cache hit.
[2024-05-28 17:21:02] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:21:02] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-28 17:21:02] [INFO ] Invariant cache hit.
[2024-05-28 17:21:02] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 17:21:05] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:21:05] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 6 (OVERLAPS) 144/252 variables, 108/114 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 70/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 184 constraints, problems are : Problem set: 3 solved, 140 unsolved in 8759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 143/249 variables, 106/112 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 69/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 28/209 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 3/252 variables, 2/211 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 112/324 constraints. Problems are: Problem set: 3 solved, 140 unsolved
[2024-05-28 17:21:20] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 1/325 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/325 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 17 (OVERLAPS) 0/252 variables, 0/325 constraints. Problems are: Problem set: 4 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 325 constraints, problems are : Problem set: 4 solved, 139 unsolved in 22202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 3/3 constraints]
After SMT, in 31166ms problems are : Problem set: 4 solved, 139 unsolved
Search for dead transitions found 4 dead transitions in 31170ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/167 places, 140/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 140
Applied a total of 4 rules in 2 ms. Remains 104 /108 variables (removed 4) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 104 cols
[2024-05-28 17:21:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:21:33] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 17:21:33] [INFO ] Invariant cache hit.
[2024-05-28 17:21:34] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 17:21:34] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/167 places, 140/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32185 ms. Remains : 104/167 places, 140/395 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 finished in 32401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 149 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 149 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 149 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 55 place count 131 transition count 185
Iterating global reduction 1 with 18 rules applied. Total rules applied 73 place count 131 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 131 transition count 179
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 117 transition count 155
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 117 transition count 155
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 117 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 113 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 109 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 109 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 107 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 107 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 107 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 105 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 104 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 103 transition count 127
Applied a total of 147 rules in 16 ms. Remains 103 /167 variables (removed 64) and now considering 127/395 (removed 268) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-28 17:21:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:21:34] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 17:21:34] [INFO ] Invariant cache hit.
[2024-05-28 17:21:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 17:21:34] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-28 17:21:34] [INFO ] Invariant cache hit.
[2024-05-28 17:21:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 17:21:36] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:21:36] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/109 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/165 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 17:21:39] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:21:39] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 167 constraints, problems are : Problem set: 3 solved, 123 unsolved in 6551 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 126/227 variables, 101/109 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 55/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 26/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 3/230 variables, 2/192 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 97/290 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 1/291 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 18 (OVERLAPS) 0/230 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 291 constraints, problems are : Problem set: 4 solved, 122 unsolved in 16732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 23419ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 23420ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/167 places, 123/395 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 1 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 17:21:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:21:58] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 17:21:58] [INFO ] Invariant cache hit.
[2024-05-28 17:21:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 17:21:58] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/167 places, 123/395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24285 ms. Remains : 99/167 places, 123/395 transitions.
Stuttering acceptance computed with spot in 114 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 229 ms.
Product exploration explored 100000 steps with 33333 reset in 255 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 finished in 25094 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||G(!p0))) U ((G(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p3)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 167/167 places, 395/395 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 206
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 206
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 133 transition count 189
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 133 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 133 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 88 place count 120 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 101 place count 120 transition count 159
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 120 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 117 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 117 transition count 146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 114 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 114 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 113 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 113 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 113 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 112 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 112 transition count 139
Applied a total of 129 rules in 20 ms. Remains 112 /167 variables (removed 55) and now considering 139/395 (removed 256) transitions.
// Phase 1: matrix 139 rows 112 cols
[2024-05-28 17:22:00] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:22:00] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-28 17:22:00] [INFO ] Invariant cache hit.
[2024-05-28 17:22:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 17:22:00] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-28 17:22:00] [INFO ] Invariant cache hit.
[2024-05-28 17:22:00] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:22:02] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:22:02] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:22:03] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-28 17:22:03] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 8 (OVERLAPS) 139/251 variables, 112/120 constraints. Problems are: Problem set: 3 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 61/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 181 constraints, problems are : Problem set: 3 solved, 135 unsolved in 6816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 138/248 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 29/207 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 3/251 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 106/316 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 17:22:18] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:22:18] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 2/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/251 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
At refinement iteration 18 (OVERLAPS) 0/251 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 318 constraints, problems are : Problem set: 4 solved, 134 unsolved in 26393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/138 constraints, Known Traps: 6/6 constraints]
After SMT, in 33380ms problems are : Problem set: 4 solved, 134 unsolved
Search for dead transitions found 4 dead transitions in 33382ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 112/167 places, 135/395 transitions.
Graph (complete) has 357 edges and 112 vertex of which 108 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 17:22:34] [INFO ] Computed 4 invariants in 14 ms
[2024-05-28 17:22:34] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 17:22:34] [INFO ] Invariant cache hit.
[2024-05-28 17:22:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 17:22:34] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 108/167 places, 135/395 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 34464 ms. Remains : 108/167 places, 135/395 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
Product exploration explored 100000 steps with 22511 reset in 164 ms.
Product exploration explored 100000 steps with 22371 reset in 176 ms.
Computed a total of 23 stabilizing places and 30 stable transitions
Graph (complete) has 353 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8986 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1875 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1821566 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :0 out of 1
Probabilistic random walk after 1821566 steps, saw 783568 distinct states, run finished after 3001 ms. (steps per millisecond=606 ) properties seen :0
[2024-05-28 17:22:38] [INFO ] Invariant cache hit.
[2024-05-28 17:22:38] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
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) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/243 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/243 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Graph (complete) has 316 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 133
Applied a total of 3 rules in 3 ms. Remains 107 /108 variables (removed 1) and now considering 133/135 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 107/108 places, 133/135 transitions.
RANDOM walk for 40000 steps (8980 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1835139 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :0 out of 1
Probabilistic random walk after 1835139 steps, saw 790733 distinct states, run finished after 3001 ms. (steps per millisecond=611 ) properties seen :0
// Phase 1: matrix 133 rows 107 cols
[2024-05-28 17:22:42] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:22:42] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
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) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/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) 116/182 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/240 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/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) 116/182 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/240 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 107/107 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-28 17:22:42] [INFO ] Invariant cache hit.
[2024-05-28 17:22:42] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 17:22:42] [INFO ] Invariant cache hit.
[2024-05-28 17:22:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 17:22:42] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-28 17:22:42] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-28 17:22:42] [INFO ] Invariant cache hit.
[2024-05-28 17:22:42] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/240 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 58/168 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-28 17:22:47] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/240 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 169 constraints, problems are : Problem set: 3 solved, 129 unsolved in 7508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 4/107 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 133/240 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 58/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 129/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 298 constraints, problems are : Problem set: 3 solved, 129 unsolved in 11492 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 1/1 constraints]
After SMT, in 19187ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 19193ms
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 REACHABILITY mode, iteration 1 : 107/107 places, 130/133 transitions.
Graph (complete) has 307 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 104 /107 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 17:23:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 17:23:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 17:23:02] [INFO ] Invariant cache hit.
[2024-05-28 17:23:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 17:23:02] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/107 places, 130/133 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20047 ms. Remains : 104/107 places, 130/133 transitions.
RANDOM walk for 40000 steps (8924 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1922 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1865414 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :0 out of 1
Probabilistic random walk after 1865414 steps, saw 803505 distinct states, run finished after 3001 ms. (steps per millisecond=621 ) properties seen :0
[2024-05-28 17:23:05] [INFO ] Invariant cache hit.
[2024-05-28 17:23:05] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
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) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:23:06] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 562ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 17:23:06] [INFO ] Invariant cache hit.
[2024-05-28 17:23:06] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-28 17:23:06] [INFO ] Invariant cache hit.
[2024-05-28 17:23:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 17:23:06] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-28 17:23:06] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 17:23:06] [INFO ] Invariant cache hit.
[2024-05-28 17:23:06] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 17:23:13] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 11570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 16004ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 16006ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16524 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 104 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 123
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 98 transition count 107
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 82 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 76 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 110
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 75 transition count 110
Applied a total of 61 rules in 9 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 17:23:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 17:23:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 17:23:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:23:23] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:23:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 17:23:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:23:23] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 17:23:23] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:23:23] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 557 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 17:23:23] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 17:23:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 17:23:23] [INFO ] Invariant cache hit.
[2024-05-28 17:23:23] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 17:23:24] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-28 17:23:24] [INFO ] Invariant cache hit.
[2024-05-28 17:23:24] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 60/172 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 17:23:27] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/243 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 173 constraints, problems are : Problem set: 3 solved, 131 unsolved in 6607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 4/108 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 60/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 131/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 304 constraints, problems are : Problem set: 3 solved, 131 unsolved in 9578 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 1/1 constraints]
After SMT, in 16337ms problems are : Problem set: 3 solved, 131 unsolved
Search for dead transitions found 3 dead transitions in 16339ms
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 : 108/108 places, 132/135 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 132
Applied a total of 3 rules in 1 ms. Remains 105 /108 variables (removed 3) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 105 cols
[2024-05-28 17:23:40] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:23:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 17:23:40] [INFO ] Invariant cache hit.
[2024-05-28 17:23:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 17:23:40] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/108 places, 132/135 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17233 ms. Remains : 105/108 places, 132/135 transitions.
Computed a total of 20 stabilizing places and 27 stable transitions
Graph (complete) has 343 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 20 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9000 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1844460 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :0 out of 1
Probabilistic random walk after 1844460 steps, saw 794588 distinct states, run finished after 3001 ms. (steps per millisecond=614 ) properties seen :0
[2024-05-28 17:23:44] [INFO ] Invariant cache hit.
[2024-05-28 17:23:44] [INFO ] State equation strengthened by 59 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) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/237 variables, 31/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/237 variables, 31/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/237 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 132/132 transitions.
Graph (complete) has 307 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 130
Applied a total of 3 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/105 places, 130/132 transitions.
RANDOM walk for 40000 steps (8988 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1848 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1881349 steps, run timeout after 3001 ms. (steps per millisecond=626 ) properties seen :0 out of 1
Probabilistic random walk after 1881349 steps, saw 810100 distinct states, run finished after 3001 ms. (steps per millisecond=626 ) properties seen :0
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 17:23:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 17:23:47] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
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) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:23:48] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 17:23:48] [INFO ] Invariant cache hit.
[2024-05-28 17:23:48] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-28 17:23:48] [INFO ] Invariant cache hit.
[2024-05-28 17:23:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 17:23:48] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-28 17:23:48] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 17:23:48] [INFO ] Invariant cache hit.
[2024-05-28 17:23:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 17:23:55] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 11583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 16017ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 16019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16524 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 104 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 123
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 98 transition count 107
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 82 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 76 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 110
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 75 transition count 110
Applied a total of 61 rules in 44 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 17:24:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 17:24:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 17:24:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 12 ms returned sat
[2024-05-28 17:24:05] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:24:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 17:24:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:24:05] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 17:24:05] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:24:05] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 424 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22366 reset in 156 ms.
Product exploration explored 100000 steps with 22374 reset in 165 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 17:24:06] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
// Phase 1: matrix 132 rows 105 cols
[2024-05-28 17:24:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 17:24:06] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 299 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
After SMT, in 21003ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 21004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21013 ms. Remains : 105/105 places, 132/132 transitions.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 17:24:27] [INFO ] Invariant cache hit.
[2024-05-28 17:24:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 17:24:27] [INFO ] Invariant cache hit.
[2024-05-28 17:24:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 17:24:27] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-05-28 17:24:27] [INFO ] Invariant cache hit.
[2024-05-28 17:24:27] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 299 constraints, problems are : Problem set: 0 solved, 131 unsolved in 15966 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
After SMT, in 20907ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 20910ms
Finished structural reductions in LTL mode , in 1 iterations and 21340 ms. Remains : 105/105 places, 132/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 finished in 168900 ms.
[2024-05-28 17:24:48] [INFO ] Flatten gal took : 53 ms
[2024-05-28 17:24:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 17:24:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 395 transitions and 1561 arcs took 12 ms.
Total runtime 1050658 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SieveSingleMsgMbox-PT-d2m18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 167
TRANSITIONS: 395
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2215
MODEL NAME: /home/mcc/execution/413/model
167 places, 395 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 CANNOT_COMPUTE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716917473980
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-d2m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d2m18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809700116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 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 '
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 ;