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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 19:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 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-d2m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716927277896

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-d2m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 20:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 20:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:14:41] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2024-05-28 20:14:41] [INFO ] Transformed 2398 places.
[2024-05-28 20:14:41] [INFO ] Transformed 1954 transitions.
[2024-05-28 20:14:41] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 783 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 39 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 956 place count 286 transition count 588
Iterating global reduction 1 with 103 rules applied. Total rules applied 1059 place count 286 transition count 588
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1070 place count 286 transition count 577
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 1146 place count 210 transition count 501
Iterating global reduction 2 with 76 rules applied. Total rules applied 1222 place count 210 transition count 501
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1252 place count 210 transition count 471
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1280 place count 182 transition count 437
Iterating global reduction 3 with 28 rules applied. Total rules applied 1308 place count 182 transition count 437
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 1359 place count 182 transition count 386
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1363 place count 178 transition count 380
Iterating global reduction 4 with 4 rules applied. Total rules applied 1367 place count 178 transition count 380
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1371 place count 174 transition count 376
Iterating global reduction 4 with 4 rules applied. Total rules applied 1375 place count 174 transition count 376
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1377 place count 172 transition count 373
Iterating global reduction 4 with 2 rules applied. Total rules applied 1379 place count 172 transition count 373
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1381 place count 170 transition count 371
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 170 transition count 371
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1385 place count 168 transition count 369
Iterating global reduction 4 with 2 rules applied. Total rules applied 1387 place count 168 transition count 369
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1388 place count 167 transition count 368
Iterating global reduction 4 with 1 rules applied. Total rules applied 1389 place count 167 transition count 368
Applied a total of 1389 rules in 166 ms. Remains 167 /414 variables (removed 247) and now considering 368/1954 (removed 1586) transitions.
// Phase 1: matrix 368 rows 167 cols
[2024-05-28 20:14:41] [INFO ] Computed 5 invariants in 33 ms
[2024-05-28 20:14:42] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-28 20:14:42] [INFO ] Invariant cache hit.
[2024-05-28 20:14:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-28 20:14:43] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-28 20:14:43] [INFO ] Invariant cache hit.
[2024-05-28 20:14:44] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 1/167 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-28 20:14:54] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 32 ms to minimize.
[2024-05-28 20:14:54] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/535 variables, 167/174 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 241/415 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-28 20:15:05] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 2 ms to minimize.
[2024-05-28 20:15:05] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 3 ms to minimize.
[2024-05-28 20:15:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 3/418 constraints. Problems are: Problem set: 3 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 418 constraints, problems are : Problem set: 3 solved, 364 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 167/167 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 4/167 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 5/10 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 368/535 variables, 167/177 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 241/418 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 364/782 constraints. Problems are: Problem set: 3 solved, 364 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/782 constraints. Problems are: Problem set: 3 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 782 constraints, problems are : Problem set: 3 solved, 364 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 167/167 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 364/367 constraints, Known Traps: 5/5 constraints]
After SMT, in 61680ms problems are : Problem set: 3 solved, 364 unsolved
Search for dead transitions found 3 dead transitions in 61723ms
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 : 167/414 places, 365/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 164 transition count 365
Applied a total of 3 rules in 6 ms. Remains 164 /167 variables (removed 3) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 164 cols
[2024-05-28 20:15:45] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 20:15:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-28 20:15:45] [INFO ] Invariant cache hit.
[2024-05-28 20:15:46] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-28 20:15:46] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/414 places, 365/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64948 ms. Remains : 164/414 places, 365/1954 transitions.
Support contains 21 out of 164 places after structural reductions.
[2024-05-28 20:15:47] [INFO ] Flatten gal took : 82 ms
[2024-05-28 20:15:47] [INFO ] Flatten gal took : 43 ms
[2024-05-28 20:15:47] [INFO ] Input system was already deterministic with 365 transitions.
RANDOM walk for 40000 steps (8975 resets) in 4184 ms. (9 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (214 resets) in 74 ms. (53 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (187 resets) in 45 ms. (87 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (197 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (208 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (186 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (193 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (201 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (191 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (192 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (426 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (185 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (196 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (187 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (202 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (396 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (177 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (196 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (181 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 227830 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :5 out of 18
Probabilistic random walk after 227830 steps, saw 101471 distinct states, run finished after 3009 ms. (steps per millisecond=75 ) properties seen :5
[2024-05-28 20:15:51] [INFO ] Invariant cache hit.
[2024-05-28 20:15:51] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 78/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 36/130 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-28 20:15:52] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 2 ms to minimize.
[2024-05-28 20:15:52] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 2 ms to minimize.
[2024-05-28 20:15:52] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 2 ms to minimize.
[2024-05-28 20:15:52] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:15:52] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 289/419 variables, 130/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 164/303 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 110/529 variables, 34/337 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 76/413 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/529 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 413 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/164 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 36/129 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 275/404 variables, 129/138 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 150/288 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 125/529 variables, 35/323 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 90/413 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 12/425 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-28 20:15:55] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 1/426 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/426 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-28 20:15:57] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/529 variables, 1/427 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 0/427 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/529 variables, 0/427 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 427 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/164 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 7/7 constraints]
After SMT, in 6834ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 365/365 transitions.
Graph (complete) has 627 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 163 transition count 363
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 158 transition count 293
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 158 transition count 293
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 153 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 153 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 153 transition count 285
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 149 transition count 277
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 149 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 149 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 148 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 148 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 147 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 147 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 146 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 146 transition count 271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 51 place count 146 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 145 transition count 262
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 145 transition count 262
Applied a total of 53 rules in 92 ms. Remains 145 /164 variables (removed 19) and now considering 262/365 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 145/164 places, 262/365 transitions.
RANDOM walk for 40000 steps (8895 resets) in 353 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1897 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1941 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4148 resets) in 239 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4011 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1862 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1840 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1848 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 231707 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 12
Probabilistic random walk after 231707 steps, saw 100265 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 262 rows 145 cols
[2024-05-28 20:16:02] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 20:16:02] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 243/335 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 136/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 72/407 variables, 53/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 19/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 303 constraints, problems are : Problem set: 0 solved, 12 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 243/335 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 136/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 72/407 variables, 53/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 19/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 12/315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-28 20:16:04] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 2 ms to minimize.
[2024-05-28 20:16:04] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 317 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2745 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 3653ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 38232 ms.
Support contains 14 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 262/262 transitions.
Applied a total of 0 rules in 17 ms. Remains 145 /145 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 145/145 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 145 /145 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-28 20:16:44] [INFO ] Invariant cache hit.
[2024-05-28 20:16:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-28 20:16:44] [INFO ] Invariant cache hit.
[2024-05-28 20:16:44] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-28 20:16:45] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-28 20:16:45] [INFO ] Redundant transitions in 15 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-28 20:16:45] [INFO ] Invariant cache hit.
[2024-05-28 20:16:45] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 4 (OVERLAPS) 262/407 variables, 145/148 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 155/303 constraints. Problems are: Problem set: 3 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 303 constraints, problems are : Problem set: 3 solved, 258 unsolved in 18305 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 261/403 variables, 142/145 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 154/299 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 22/321 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 4/407 variables, 3/324 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 1/325 constraints. Problems are: Problem set: 3 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 236/561 constraints. Problems are: Problem set: 3 solved, 258 unsolved
[2024-05-28 20:17:29] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:17:30] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 563 constraints, problems are : Problem set: 3 solved, 258 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 48719ms problems are : Problem set: 3 solved, 258 unsolved
Search for dead transitions found 3 dead transitions in 48723ms
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 : 145/145 places, 259/262 transitions.
Graph (complete) has 494 edges and 145 vertex of which 142 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 16 ms. Remains 142 /145 variables (removed 3) and now considering 259/259 (removed 0) transitions.
// Phase 1: matrix 259 rows 142 cols
[2024-05-28 20:17:33] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 20:17:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 20:17:33] [INFO ] Invariant cache hit.
[2024-05-28 20:17:34] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-28 20:17:34] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/145 places, 259/262 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50207 ms. Remains : 142/145 places, 259/262 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 52 stable transitions
Graph (complete) has 684 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 218
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 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 31 place count 149 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 134 transition count 201
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 134 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 134 transition count 194
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 122 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 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 101 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 116 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 114 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 114 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 112 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 112 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 110 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 109 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 109 transition count 149
Applied a total of 127 rules in 29 ms. Remains 109 /164 variables (removed 55) and now considering 149/365 (removed 216) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-05-28 20:17:34] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:17:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 20:17:34] [INFO ] Invariant cache hit.
[2024-05-28 20:17:35] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 20:17:35] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-28 20:17:35] [INFO ] Invariant cache hit.
[2024-05-28 20:17:35] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 5 (OVERLAPS) 149/258 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 187 constraints, problems are : Problem set: 3 solved, 145 unsolved in 5134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 149/257 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 18/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/258 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 127/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 332 constraints, problems are : Problem set: 3 solved, 145 unsolved in 13958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 19248ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 19250ms
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 : 109/164 places, 146/365 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 146
Applied a total of 3 rules in 1 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 20:17:54] [INFO ] Computed 4 invariants in 14 ms
[2024-05-28 20:17:54] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 20:17:54] [INFO ] Invariant cache hit.
[2024-05-28 20:17:54] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 20:17:55] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/164 places, 146/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20293 ms. Remains : 106/164 places, 146/365 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 finished in 20695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 204
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 148 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 132 transition count 186
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 132 transition count 186
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 132 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 119 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 119 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 119 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 115 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 115 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 111 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 131
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 104 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 126
Applied a total of 143 rules in 54 ms. Remains 102 /164 variables (removed 62) and now considering 126/365 (removed 239) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-28 20:17:55] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:17:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 20:17:55] [INFO ] Invariant cache hit.
[2024-05-28 20:17:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 20:17:55] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-28 20:17:55] [INFO ] Redundant transitions in 1 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-28 20:17:55] [INFO ] Invariant cache hit.
[2024-05-28 20:17:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 4099 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 11516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 15744ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 15747ms
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 SI_LTL mode, iteration 1 : 102/164 places, 123/365 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 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 6 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 20:18:11] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:18:11] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 20:18:11] [INFO ] Invariant cache hit.
[2024-05-28 20:18:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 20:18:12] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/164 places, 123/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16664 ms. Remains : 99/164 places, 123/365 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
Product exploration explored 100000 steps with 22548 reset in 357 ms.
Product exploration explored 100000 steps with 22460 reset in 287 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.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8957 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1891 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1968391 steps, run timeout after 3001 ms. (steps per millisecond=655 ) properties seen :0 out of 1
Probabilistic random walk after 1968391 steps, saw 827735 distinct states, run finished after 3001 ms. (steps per millisecond=655 ) properties seen :0
[2024-05-28 20:18:15] [INFO ] Invariant cache hit.
[2024-05-28 20:18:15] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Graph (complete) has 289 edges and 99 vertex of which 98 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 98 transition count 121
Applied a total of 3 rules in 7 ms. Remains 98 /99 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/99 places, 121/123 transitions.
RANDOM walk for 40000 steps (8939 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1851 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1920456 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :0 out of 1
Probabilistic random walk after 1920456 steps, saw 808532 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-05-28 20:18:19] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 20:18:19] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 460 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 20:18:20] [INFO ] Invariant cache hit.
[2024-05-28 20:18:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 20:18:20] [INFO ] Invariant cache hit.
[2024-05-28 20:18:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 20:18:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-28 20:18:20] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 20:18:20] [INFO ] Invariant cache hit.
[2024-05-28 20:18:20] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3983 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7813 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 11929ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 11930ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12354 ms. Remains : 98/98 places, 121/121 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 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
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 92 transition count 99
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 77 transition count 99
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 55 place count 71 transition count 93
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 57 place count 70 transition count 102
Applied a total of 57 rules in 24 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-05-28 20:18:32] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:18:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:18:32] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:18:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:18:32] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:18:32] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:18:32] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 276 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 20:18:33] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:18:33] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 20:18:33] [INFO ] Invariant cache hit.
[2024-05-28 20:18:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 20:18:33] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-28 20:18:33] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-28 20:18:33] [INFO ] Invariant cache hit.
[2024-05-28 20:18:33] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 13451ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13452ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13922 ms. Remains : 99/99 places, 123/123 transitions.
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.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9030 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1880 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1987736 steps, run timeout after 3001 ms. (steps per millisecond=662 ) properties seen :0 out of 1
Probabilistic random walk after 1987736 steps, saw 835071 distinct states, run finished after 3001 ms. (steps per millisecond=662 ) properties seen :0
[2024-05-28 20:18:50] [INFO ] Invariant cache hit.
[2024-05-28 20:18:50] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Graph (complete) has 289 edges and 99 vertex of which 98 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 98 transition count 121
Applied a total of 3 rules in 7 ms. Remains 98 /99 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/99 places, 121/123 transitions.
RANDOM walk for 40000 steps (8926 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1959 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2035633 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :0 out of 1
Probabilistic random walk after 2035633 steps, saw 854940 distinct states, run finished after 3001 ms. (steps per millisecond=678 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-05-28 20:18:53] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:18:53] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 445 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 20:18:54] [INFO ] Invariant cache hit.
[2024-05-28 20:18:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 20:18:54] [INFO ] Invariant cache hit.
[2024-05-28 20:18:54] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 20:18:55] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-28 20:18:55] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 20:18:55] [INFO ] Invariant cache hit.
[2024-05-28 20:18:55] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 11452ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 11455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11877 ms. Remains : 98/98 places, 121/121 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 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
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 92 transition count 99
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 77 transition count 99
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 55 place count 71 transition count 93
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 57 place count 70 transition count 102
Applied a total of 57 rules in 14 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-05-28 20:19:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:19:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:19:06] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:19:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:19:06] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:19:06] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:19:06] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 241 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 22335 reset in 151 ms.
Product exploration explored 100000 steps with 22493 reset in 163 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 20:19:07] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 20:19:07] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 20:19:07] [INFO ] Invariant cache hit.
[2024-05-28 20:19:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 20:19:07] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-28 20:19:07] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-28 20:19:07] [INFO ] Invariant cache hit.
[2024-05-28 20:19:07] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 13273ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13650 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 finished in 85665 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(!p0)))))'
Support contains 0 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 204
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 148 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 132 transition count 186
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 132 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 132 transition count 178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 86 place count 119 transition count 155
Iterating global reduction 2 with 13 rules applied. Total rules applied 99 place count 119 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 108 place count 119 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 115 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 115 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 111 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 111 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 108 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 108 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 132 place count 108 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 105 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 105 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 104 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 104 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 103 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 103 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 102 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 102 transition count 125
Applied a total of 144 rules in 31 ms. Remains 102 /164 variables (removed 62) and now considering 125/365 (removed 240) transitions.
// Phase 1: matrix 125 rows 102 cols
[2024-05-28 20:19:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:19:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 20:19:21] [INFO ] Invariant cache hit.
[2024-05-28 20:19:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 20:19:21] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-28 20:19:21] [INFO ] Redundant transitions in 0 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-28 20:19:21] [INFO ] Invariant cache hit.
[2024-05-28 20:19:21] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 5 (OVERLAPS) 125/227 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 162 constraints, problems are : Problem set: 3 solved, 121 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 125/226 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 1/227 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 104/283 constraints. Problems are: Problem set: 3 solved, 121 unsolved
[2024-05-28 20:19:30] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/284 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 0/227 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 284 constraints, problems are : Problem set: 3 solved, 121 unsolved in 11810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 121/124 constraints, Known Traps: 1/1 constraints]
After SMT, in 15898ms problems are : Problem set: 3 solved, 121 unsolved
Search for dead transitions found 3 dead transitions in 15899ms
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 SI_LTL mode, iteration 1 : 102/164 places, 122/365 transitions.
Graph (complete) has 324 edges and 102 vertex of which 99 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 5 ms. Remains 99 /102 variables (removed 3) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 99 cols
[2024-05-28 20:19:37] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:19:37] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 20:19:37] [INFO ] Invariant cache hit.
[2024-05-28 20:19:37] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 20:19:37] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/164 places, 122/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16735 ms. Remains : 99/164 places, 122/365 transitions.
Stuttering acceptance computed with spot in 13 ms :[true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-03
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 finished in 16764 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)&&G(F(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 218
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 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 31 place count 149 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 134 transition count 201
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 134 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 134 transition count 194
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 122 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 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 101 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 116 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 114 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 114 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 112 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 112 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 110 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 109 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 109 transition count 149
Applied a total of 127 rules in 26 ms. Remains 109 /164 variables (removed 55) and now considering 149/365 (removed 216) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-05-28 20:19:37] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:19:37] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 20:19:37] [INFO ] Invariant cache hit.
[2024-05-28 20:19:38] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 20:19:38] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-28 20:19:38] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-28 20:19:38] [INFO ] Invariant cache hit.
[2024-05-28 20:19:38] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 5 (OVERLAPS) 149/258 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 187 constraints, problems are : Problem set: 3 solved, 145 unsolved in 5173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 149/257 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 18/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/258 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 127/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 332 constraints, problems are : Problem set: 3 solved, 145 unsolved in 13605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 18935ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 18937ms
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 SI_LTL mode, iteration 1 : 109/164 places, 146/365 transitions.
Graph (complete) has 360 edges and 109 vertex of which 106 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 5 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 20:19:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:19:57] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 20:19:57] [INFO ] Invariant cache hit.
[2024-05-28 20:19:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 20:19:57] [INFO ] Implicit Places using invariants and state equation in 458 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/164 places, 146/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20092 ms. Remains : 106/164 places, 146/365 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 finished in 20268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 191
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 191
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 148 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 132 transition count 173
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 132 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 132 transition count 165
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 86 place count 119 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 99 place count 119 transition count 141
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 107 place count 119 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 114 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 114 transition count 128
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 109 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 109 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 105 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 105 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 105 transition count 117
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 101 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 100 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 99 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 99 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 98 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 98 transition count 108
Applied a total of 151 rules in 20 ms. Remains 98 /164 variables (removed 66) and now considering 108/365 (removed 257) transitions.
// Phase 1: matrix 108 rows 98 cols
[2024-05-28 20:19:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:19:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 20:19:58] [INFO ] Invariant cache hit.
[2024-05-28 20:19:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 20:19:58] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-28 20:19:58] [INFO ] Redundant transitions in 0 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-28 20:19:58] [INFO ] Invariant cache hit.
[2024-05-28 20:19:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 5 (OVERLAPS) 108/206 variables, 98/102 constraints. Problems are: Problem set: 3 solved, 104 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 42/144 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 144 constraints, problems are : Problem set: 3 solved, 104 unsolved in 3365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 2/97 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 108/205 variables, 97/101 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 42/143 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 16/159 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 1/206 variables, 1/160 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 88/248 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/248 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/248 constraints. Problems are: Problem set: 3 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 248 constraints, problems are : Problem set: 3 solved, 104 unsolved in 7300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 104/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 10753ms problems are : Problem set: 3 solved, 104 unsolved
Search for dead transitions found 3 dead transitions in 10754ms
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 SI_LTL mode, iteration 1 : 98/164 places, 105/365 transitions.
Graph (complete) has 301 edges and 98 vertex of which 95 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 4 ms. Remains 95 /98 variables (removed 3) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 95 cols
[2024-05-28 20:20:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/164 places, 105/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11453 ms. Remains : 95/164 places, 105/365 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 finished in 11507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1 U p2)))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 150 transition count 219
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 150 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 150 transition count 218
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 136 transition count 203
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 136 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 136 transition count 197
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 125 transition count 178
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 125 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 94 place count 125 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 123 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 123 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 121 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 121 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 120 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 120 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 119 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 119 transition count 163
Applied a total of 106 rules in 21 ms. Remains 119 /164 variables (removed 45) and now considering 163/365 (removed 202) transitions.
// Phase 1: matrix 163 rows 119 cols
[2024-05-28 20:20:09] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-28 20:20:10] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-28 20:20:10] [INFO ] Redundant transitions in 0 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 5 (OVERLAPS) 163/282 variables, 119/123 constraints. Problems are: Problem set: 3 solved, 159 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 79/202 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 202 constraints, problems are : Problem set: 3 solved, 159 unsolved in 6098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 2/118 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 163/281 variables, 118/122 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 79/201 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 19/220 constraints. Problems are: Problem set: 3 solved, 159 unsolved
[2024-05-28 20:20:19] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/221 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 1/282 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 140/362 constraints. Problems are: Problem set: 3 solved, 159 unsolved
[2024-05-28 20:20:26] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:20:28] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 2/364 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/364 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 16 (OVERLAPS) 0/282 variables, 0/364 constraints. Problems are: Problem set: 3 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 364 constraints, problems are : Problem set: 3 solved, 159 unsolved in 22073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 159/162 constraints, Known Traps: 3/3 constraints]
After SMT, in 28361ms problems are : Problem set: 3 solved, 159 unsolved
Search for dead transitions found 3 dead transitions in 28363ms
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 SI_LTL mode, iteration 1 : 119/164 places, 160/365 transitions.
Graph (complete) has 394 edges and 119 vertex of which 116 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 6 ms. Remains 116 /119 variables (removed 3) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-28 20:20:38] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:20:38] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 20:20:38] [INFO ] Invariant cache hit.
[2024-05-28 20:20:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-28 20:20:38] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/164 places, 160/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29346 ms. Remains : 116/164 places, 160/365 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 finished in 29500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((!p1||G(!p0)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 218
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 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 31 place count 149 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 134 transition count 201
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 134 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 69 place count 134 transition count 193
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 81 place count 122 transition count 172
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 122 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 102 place count 122 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 118 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 118 transition count 159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 114 transition count 155
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 114 transition count 155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 111 transition count 152
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 111 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 111 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 108 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 107 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 107 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 106 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 106 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 105 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 105 transition count 141
Applied a total of 139 rules in 19 ms. Remains 105 /164 variables (removed 59) and now considering 141/365 (removed 224) transitions.
// Phase 1: matrix 141 rows 105 cols
[2024-05-28 20:20:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:20:39] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 20:20:39] [INFO ] Invariant cache hit.
[2024-05-28 20:20:39] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:20:39] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-28 20:20:39] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 20:20:39] [INFO ] Invariant cache hit.
[2024-05-28 20:20:39] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 5 (OVERLAPS) 141/246 variables, 105/109 constraints. Problems are: Problem set: 3 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 69/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 178 constraints, problems are : Problem set: 3 solved, 137 unsolved in 4598 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 2/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 18/195 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 119/315 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/315 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 14 (OVERLAPS) 0/246 variables, 0/315 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 315 constraints, problems are : Problem set: 3 solved, 137 unsolved in 12169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 16910ms problems are : Problem set: 3 solved, 137 unsolved
Search for dead transitions found 3 dead transitions in 16912ms
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 SI_LTL mode, iteration 1 : 105/164 places, 138/365 transitions.
Graph (complete) has 345 edges and 105 vertex of which 102 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 3 ms. Remains 102 /105 variables (removed 3) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 102 cols
[2024-05-28 20:20:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:20:56] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 20:20:56] [INFO ] Invariant cache hit.
[2024-05-28 20:20:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 20:20:56] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/164 places, 138/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17808 ms. Remains : 102/164 places, 138/365 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p0), (NOT p0), p0, (AND p0 p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
Product exploration explored 100000 steps with 22377 reset in 251 ms.
Product exploration explored 100000 steps with 22496 reset in 285 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, p0, (AND p0 p1)]
RANDOM walk for 40000 steps (8977 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1883 resets) in 362 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1818 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1828 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 238219 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 238219 steps, saw 108065 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-28 20:21:01] [INFO ] Invariant cache hit.
[2024-05-28 20:21:01] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/76 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/197 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 51/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/240 variables, 26/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 17/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 174 constraints, problems are : Problem set: 1 solved, 3 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/76 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 121/197 variables, 76/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 51/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/240 variables, 26/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 17/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 3/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8323 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 138/138 transitions.
Graph (complete) has 308 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 136
Applied a total of 3 rules in 6 ms. Remains 101 /102 variables (removed 1) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/102 places, 136/138 transitions.
RANDOM walk for 40000 steps (8926 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1817 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1844 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1874 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 356472 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 3
Probabilistic random walk after 356472 steps, saw 160384 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 136 rows 101 cols
[2024-05-28 20:21:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:21:13] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/237 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/237 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/237 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 19253 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 136/136 transitions.
Applied a total of 0 rules in 17 ms. Remains 101 /101 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-28 20:21:33] [INFO ] Invariant cache hit.
[2024-05-28 20:21:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 20:21:33] [INFO ] Invariant cache hit.
[2024-05-28 20:21:33] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 20:21:33] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-28 20:21:33] [INFO ] Redundant transitions in 0 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-28 20:21:33] [INFO ] Invariant cache hit.
[2024-05-28 20:21:33] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/237 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 170 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/237 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 135/305 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 305 constraints, problems are : Problem set: 0 solved, 135 unsolved in 8483 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 12968ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 12969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13403 ms. Remains : 101/101 places, 136/136 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 101 transition count 129
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 95 transition count 129
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 95 transition count 114
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 80 transition count 114
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 55 place count 74 transition count 108
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 57 place count 73 transition count 117
Applied a total of 57 rules in 9 ms. Remains 73 /101 variables (removed 28) and now considering 117/136 (removed 19) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 117 rows 73 cols
[2024-05-28 20:21:46] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:21:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:21:46] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 20:21:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:21:47] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 20:21:47] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 20:21:47] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 410 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 154 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 92 ms :[true, p0, (AND p0 p1)]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 102 cols
[2024-05-28 20:21:47] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:21:47] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 20:21:47] [INFO ] Invariant cache hit.
[2024-05-28 20:21:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 20:21:48] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-28 20:21:48] [INFO ] Redundant transitions in 0 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-28 20:21:48] [INFO ] Invariant cache hit.
[2024-05-28 20:21:48] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/240 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 174 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/240 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 137/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 311 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 12265ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12268ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12693 ms. Remains : 102/102 places, 138/138 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, p0, (AND p0 p1)]
RANDOM walk for 40000 steps (8943 resets) in 523 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1868 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1792 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 247347 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 4
Probabilistic random walk after 247347 steps, saw 111980 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-28 20:22:04] [INFO ] Invariant cache hit.
[2024-05-28 20:22:04] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/76 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/197 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 51/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/240 variables, 26/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 17/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 174 constraints, problems are : Problem set: 1 solved, 3 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/76 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 121/197 variables, 76/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 51/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/240 variables, 26/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 17/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 3/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8196 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 138/138 transitions.
Graph (complete) has 308 edges and 102 vertex of which 101 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 101 transition count 136
Applied a total of 3 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/102 places, 136/138 transitions.
RANDOM walk for 40000 steps (9020 resets) in 563 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1866 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1863 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 388111 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 3
Probabilistic random walk after 388111 steps, saw 173945 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 136 rows 101 cols
[2024-05-28 20:22:16] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 20:22:16] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/237 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/237 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/237 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 589ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18095 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 136/136 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-28 20:22:34] [INFO ] Invariant cache hit.
[2024-05-28 20:22:35] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 20:22:35] [INFO ] Invariant cache hit.
[2024-05-28 20:22:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 20:22:35] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-28 20:22:35] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-28 20:22:35] [INFO ] Invariant cache hit.
[2024-05-28 20:22:35] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/237 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 170 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/237 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 135/305 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 305 constraints, problems are : Problem set: 0 solved, 135 unsolved in 8849 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 13260ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 13261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13667 ms. Remains : 101/101 places, 136/136 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 101 transition count 129
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 95 transition count 129
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 95 transition count 114
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 80 transition count 114
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 55 place count 74 transition count 108
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 57 place count 73 transition count 117
Applied a total of 57 rules in 11 ms. Remains 73 /101 variables (removed 28) and now considering 117/136 (removed 19) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 117 rows 73 cols
[2024-05-28 20:22:48] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:22:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:22:48] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 20:22:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:22:48] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 20:22:49] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 20:22:49] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 472 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 86 ms :[true, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 87 ms :[true, (AND p0 p1), p0]
Product exploration explored 100000 steps with 22549 reset in 176 ms.
Product exploration explored 100000 steps with 22481 reset in 193 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 102 cols
[2024-05-28 20:22:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:22:50] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 20:22:50] [INFO ] Invariant cache hit.
[2024-05-28 20:22:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 20:22:50] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-05-28 20:22:50] [INFO ] Redundant transitions in 0 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-28 20:22:50] [INFO ] Invariant cache hit.
[2024-05-28 20:22:50] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/240 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 174 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4403 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/240 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 137/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 311 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 12439ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12441ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12925 ms. Remains : 102/102 places, 138/138 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 finished in 143784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 218
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 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 31 place count 149 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 134 transition count 201
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 134 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 134 transition count 194
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 122 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 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 101 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 113 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 113 transition count 152
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 110 transition count 149
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 110 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 109 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 107 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 107 transition count 144
Applied a total of 134 rules in 24 ms. Remains 107 /164 variables (removed 57) and now considering 144/365 (removed 221) transitions.
// Phase 1: matrix 144 rows 107 cols
[2024-05-28 20:23:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:23:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 20:23:03] [INFO ] Invariant cache hit.
[2024-05-28 20:23:03] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 20:23:03] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-28 20:23:03] [INFO ] Invariant cache hit.
[2024-05-28 20:23:03] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 5 (OVERLAPS) 144/251 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 70/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 181 constraints, problems are : Problem set: 3 solved, 140 unsolved in 5221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 144/250 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 70/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 18/198 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/251 variables, 1/199 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 122/321 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 0/251 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 321 constraints, problems are : Problem set: 3 solved, 140 unsolved in 11547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 16913ms problems are : Problem set: 3 solved, 140 unsolved
Search for dead transitions found 3 dead transitions in 16916ms
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 : 107/164 places, 141/365 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 141
Applied a total of 3 rules in 3 ms. Remains 104 /107 variables (removed 3) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 20:23:20] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 20:23:20] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 20:23:20] [INFO ] Invariant cache hit.
[2024-05-28 20:23:20] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:23:20] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/164 places, 141/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17844 ms. Remains : 104/164 places, 141/365 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
Product exploration explored 100000 steps with 22323 reset in 153 ms.
Product exploration explored 100000 steps with 22423 reset in 162 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8977 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1867 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2841 steps, run visited all 1 properties in 9 ms. (steps per millisecond=315 )
Probabilistic random walk after 2841 steps, saw 1370 distinct states, run finished after 19 ms. (steps per millisecond=149 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 20:23:22] [INFO ] Invariant cache hit.
[2024-05-28 20:23:22] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 20:23:22] [INFO ] Invariant cache hit.
[2024-05-28 20:23:22] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:23:22] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-28 20:23:22] [INFO ] Invariant cache hit.
[2024-05-28 20:23:22] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4956 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8884 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 13985ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 13987ms
Finished structural reductions in LTL mode , in 1 iterations and 14421 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8928 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1942 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2841 steps, run visited all 1 properties in 12 ms. (steps per millisecond=236 )
Probabilistic random walk after 2841 steps, saw 1370 distinct states, run finished after 12 ms. (steps per millisecond=236 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22453 reset in 154 ms.
Product exploration explored 100000 steps with 22383 reset in 164 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 20:23:38] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 20:23:38] [INFO ] Invariant cache hit.
[2024-05-28 20:23:38] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8421 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 13481ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 13483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13499 ms. Remains : 104/104 places, 141/141 transitions.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 20:23:51] [INFO ] Invariant cache hit.
[2024-05-28 20:23:51] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 20:23:51] [INFO ] Invariant cache hit.
[2024-05-28 20:23:51] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:23:52] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-28 20:23:52] [INFO ] Invariant cache hit.
[2024-05-28 20:23:52] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4995 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 11187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 16307ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 16308ms
Finished structural reductions in LTL mode , in 1 iterations and 16732 ms. Remains : 104/104 places, 141/141 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 finished in 65679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 191
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 191
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 148 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 132 transition count 173
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 132 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 132 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 119 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 119 transition count 143
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 119 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 115 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 115 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 111 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 111 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 118
Applied a total of 137 rules in 15 ms. Remains 105 /164 variables (removed 59) and now considering 118/365 (removed 247) transitions.
// Phase 1: matrix 118 rows 105 cols
[2024-05-28 20:24:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:24:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 20:24:08] [INFO ] Invariant cache hit.
[2024-05-28 20:24:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 20:24:09] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-28 20:24:09] [INFO ] Invariant cache hit.
[2024-05-28 20:24:09] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 5 (OVERLAPS) 118/223 variables, 105/109 constraints. Problems are: Problem set: 3 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 45/154 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 154 constraints, problems are : Problem set: 3 solved, 114 unsolved in 5465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 2/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 118/222 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 45/153 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 17/170 constraints. Problems are: Problem set: 3 solved, 114 unsolved
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/171 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 1/223 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 97/269 constraints. Problems are: Problem set: 3 solved, 114 unsolved
[2024-05-28 20:24:23] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:24:23] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 2/271 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/271 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/271 constraints. Problems are: Problem set: 3 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 271 constraints, problems are : Problem set: 3 solved, 114 unsolved in 19415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/117 constraints, Known Traps: 3/3 constraints]
After SMT, in 25018ms problems are : Problem set: 3 solved, 114 unsolved
Search for dead transitions found 3 dead transitions in 25020ms
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 : 105/164 places, 115/365 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 115
Applied a total of 3 rules in 4 ms. Remains 102 /105 variables (removed 3) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 102 cols
[2024-05-28 20:24:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:24:34] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 20:24:34] [INFO ] Invariant cache hit.
[2024-05-28 20:24:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 20:24:34] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/164 places, 115/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25886 ms. Remains : 102/164 places, 115/365 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 finished in 25984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 204
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 148 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 132 transition count 186
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 132 transition count 186
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 132 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 119 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 119 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 119 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 115 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 115 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 111 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 131
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 104 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 126
Applied a total of 143 rules in 17 ms. Remains 102 /164 variables (removed 62) and now considering 126/365 (removed 239) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-28 20:24:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:24:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 20:24:34] [INFO ] Invariant cache hit.
[2024-05-28 20:24:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 20:24:35] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-28 20:24:35] [INFO ] Redundant transitions in 1 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-28 20:24:35] [INFO ] Invariant cache hit.
[2024-05-28 20:24:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 5952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 13380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 19466ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 19469ms
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 SI_LTL mode, iteration 1 : 102/164 places, 123/365 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 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 3 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 20:24:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:24:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 20:24:54] [INFO ] Invariant cache hit.
[2024-05-28 20:24:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 20:24:55] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/164 places, 123/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20460 ms. Remains : 99/164 places, 123/365 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 finished in 20613 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))&&G((X(p0)||p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 205
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 transition count 205
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 134 transition count 190
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 134 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 134 transition count 183
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 122 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 122 transition count 161
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 100 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 118 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 115 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 113 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 113 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 113 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 111 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 111 transition count 139
Applied a total of 124 rules in 13 ms. Remains 111 /164 variables (removed 53) and now considering 139/365 (removed 226) transitions.
// Phase 1: matrix 139 rows 111 cols
[2024-05-28 20:24:55] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:24:55] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-28 20:24:55] [INFO ] Invariant cache hit.
[2024-05-28 20:24:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 20:24:55] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-28 20:24:55] [INFO ] Invariant cache hit.
[2024-05-28 20:24:55] [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, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 5 (OVERLAPS) 139/250 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 61/176 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 176 constraints, problems are : Problem set: 3 solved, 135 unsolved in 6951 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: 0/0 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, 0/3 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 139/249 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 18/193 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 20:25:06] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 1/250 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 117/312 constraints. Problems are: Problem set: 3 solved, 135 unsolved
[2024-05-28 20:25:13] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/313 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/313 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 16 (OVERLAPS) 0/250 variables, 0/313 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 313 constraints, problems are : Problem set: 3 solved, 135 unsolved in 19805 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: 2/2 constraints]
After SMT, in 26984ms problems are : Problem set: 3 solved, 135 unsolved
Search for dead transitions found 3 dead transitions in 26986ms
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 : 111/164 places, 136/365 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 136
Applied a total of 3 rules in 2 ms. Remains 108 /111 variables (removed 3) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 108 cols
[2024-05-28 20:25:22] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:25:22] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 20:25:22] [INFO ] Invariant cache hit.
[2024-05-28 20:25:23] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 20:25:23] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/164 places, 136/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28148 ms. Remains : 108/164 places, 136/365 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 finished in 28408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 193
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 148 transition count 191
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 50 place count 132 transition count 174
Iterating global reduction 1 with 16 rules applied. Total rules applied 66 place count 132 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 132 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 119 transition count 142
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 119 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 108 place count 119 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 114 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 114 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 123 place count 109 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 128 place count 109 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 106 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 106 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 106 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 103 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 103 transition count 116
Applied a total of 142 rules in 17 ms. Remains 103 /164 variables (removed 61) and now considering 116/365 (removed 249) transitions.
// Phase 1: matrix 116 rows 103 cols
[2024-05-28 20:25:23] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:25:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-28 20:25:23] [INFO ] Invariant cache hit.
[2024-05-28 20:25:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 20:25:24] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-28 20:25:24] [INFO ] Invariant cache hit.
[2024-05-28 20:25:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 5 (OVERLAPS) 116/219 variables, 103/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 45/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/219 variables, 1/153 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 153 constraints, problems are : Problem set: 3 solved, 112 unsolved in 7763 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 2/102 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 116/218 variables, 102/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 45/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 17/169 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 1/219 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 95/265 constraints. Problems are: Problem set: 3 solved, 112 unsolved
[2024-05-28 20:25:36] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 1/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 16 (OVERLAPS) 0/219 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 266 constraints, problems are : Problem set: 3 solved, 112 unsolved in 12215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 112/115 constraints, Known Traps: 2/2 constraints]
After SMT, in 20141ms problems are : Problem set: 3 solved, 112 unsolved
Search for dead transitions found 3 dead transitions in 20143ms
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 : 103/164 places, 113/365 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 113
Applied a total of 3 rules in 1 ms. Remains 100 /103 variables (removed 3) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 20:25:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:25:44] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 20:25:44] [INFO ] Invariant cache hit.
[2024-05-28 20:25:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 20:25:44] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/164 places, 113/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21219 ms. Remains : 100/164 places, 113/365 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-15
Product exploration explored 100000 steps with 22513 reset in 116 ms.
Product exploration explored 100000 steps with 22437 reset in 133 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 317 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8892 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1685787 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :0 out of 1
Probabilistic random walk after 1685787 steps, saw 787854 distinct states, run finished after 3004 ms. (steps per millisecond=561 ) properties seen :0
[2024-05-28 20:25:48] [INFO ] Invariant cache hit.
[2024-05-28 20:25:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/174 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 29/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 39/213 variables, 24/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/174 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 29/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/213 variables, 24/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 424 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Graph (complete) has 283 edges and 100 vertex of which 99 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 99 transition count 111
Applied a total of 3 rules in 5 ms. Remains 99 /100 variables (removed 1) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 99/100 places, 111/113 transitions.
RANDOM walk for 40000 steps (9032 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1930 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1651323 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :0 out of 1
Probabilistic random walk after 1651323 steps, saw 771405 distinct states, run finished after 3002 ms. (steps per millisecond=550 ) properties seen :0
// Phase 1: matrix 111 rows 99 cols
[2024-05-28 20:25:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:25:52] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/158 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 52/210 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/158 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/210 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/210 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 569 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 99/99 places, 111/111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-28 20:25:53] [INFO ] Invariant cache hit.
[2024-05-28 20:25:53] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 20:25:53] [INFO ] Invariant cache hit.
[2024-05-28 20:25:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 20:25:54] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-28 20:25:54] [INFO ] Redundant transitions in 0 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-28 20:25:54] [INFO ] Invariant cache hit.
[2024-05-28 20:25:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/210 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 144 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/210 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 110/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 20:26:01] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 255 constraints, problems are : Problem set: 2 solved, 108 unsolved in 8663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 13200ms problems are : Problem set: 2 solved, 108 unsolved
Search for dead transitions found 2 dead transitions in 13202ms
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 REACHABILITY mode, iteration 1 : 99/99 places, 109/111 transitions.
Graph (complete) has 277 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 97 /99 variables (removed 2) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 20:26:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 20:26:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 20:26:07] [INFO ] Invariant cache hit.
[2024-05-28 20:26:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:26:07] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/99 places, 109/111 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14162 ms. Remains : 97/99 places, 109/111 transitions.
RANDOM walk for 40000 steps (8961 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1918 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2046376 steps, run timeout after 3001 ms. (steps per millisecond=681 ) properties seen :0 out of 1
Probabilistic random walk after 2046376 steps, saw 955886 distinct states, run finished after 3001 ms. (steps per millisecond=681 ) properties seen :0
[2024-05-28 20:26:10] [INFO ] Invariant cache hit.
[2024-05-28 20:26:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/206 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 413 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 20:26:11] [INFO ] Invariant cache hit.
[2024-05-28 20:26:11] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-28 20:26:11] [INFO ] Invariant cache hit.
[2024-05-28 20:26:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:26:11] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-28 20:26:11] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 20:26:11] [INFO ] Invariant cache hit.
[2024-05-28 20:26:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 108/248 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 20:26:19] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 14305ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14794 ms. Remains : 97/97 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 97 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 91 transition count 102
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 91 transition count 86
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 75 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 71 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 55 place count 70 transition count 90
Applied a total of 55 rules in 10 ms. Remains 70 /97 variables (removed 27) and now considering 90/109 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 70 cols
[2024-05-28 20:26:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:26:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 20:26:26] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 20:26:26] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:26:26] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:26:26] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 326 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 20:26:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:26:27] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 20:26:27] [INFO ] Invariant cache hit.
[2024-05-28 20:26:27] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 20:26:27] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 20:26:27] [INFO ] Invariant cache hit.
[2024-05-28 20:26:27] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 20:26:30] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/213 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 149 constraints, problems are : Problem set: 2 solved, 110 unsolved in 5756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 3/100 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 113/213 variables, 100/105 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 44/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 110/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 259 constraints, problems are : Problem set: 2 solved, 110 unsolved in 6122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 110/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 12031ms problems are : Problem set: 2 solved, 110 unsolved
Search for dead transitions found 2 dead transitions in 12033ms
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 : 100/100 places, 111/113 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 111
Applied a total of 2 rules in 1 ms. Remains 98 /100 variables (removed 2) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 98 cols
[2024-05-28 20:26:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:26:39] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 20:26:39] [INFO ] Invariant cache hit.
[2024-05-28 20:26:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 20:26:40] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/100 places, 111/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12883 ms. Remains : 98/100 places, 111/113 transitions.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 310 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8992 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1806473 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :0 out of 1
Probabilistic random walk after 1806473 steps, saw 844425 distinct states, run finished after 3001 ms. (steps per millisecond=601 ) properties seen :0
[2024-05-28 20:26:43] [INFO ] Invariant cache hit.
[2024-05-28 20:26:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/165 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/209 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/165 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/209 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 548 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 111/111 transitions.
Graph (complete) has 277 edges and 98 vertex of which 97 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 97 transition count 109
Applied a total of 3 rules in 3 ms. Remains 97 /98 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/98 places, 109/111 transitions.
RANDOM walk for 40000 steps (8985 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1800020 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :0 out of 1
Probabilistic random walk after 1800020 steps, saw 841276 distinct states, run finished after 3001 ms. (steps per millisecond=599 ) properties seen :0
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 20:26:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 20:26:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/206 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 508 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 20:26:48] [INFO ] Invariant cache hit.
[2024-05-28 20:26:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 20:26:48] [INFO ] Invariant cache hit.
[2024-05-28 20:26:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:26:48] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-28 20:26:48] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 20:26:48] [INFO ] Invariant cache hit.
[2024-05-28 20:26:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 108/248 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 20:26:54] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 12667ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13111 ms. Remains : 97/97 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 97 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 91 transition count 102
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 91 transition count 86
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 75 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 71 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 55 place count 70 transition count 90
Applied a total of 55 rules in 8 ms. Remains 70 /97 variables (removed 27) and now considering 90/109 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 70 cols
[2024-05-28 20:27:01] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:27:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:27:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:27:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:27:01] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:27:01] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:27:01] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 242 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22408 reset in 219 ms.
Product exploration explored 100000 steps with 22440 reset in 227 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-28 20:27:02] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 98 cols
[2024-05-28 20:27:02] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:27:02] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/209 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 20:27:07] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 16289ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 16291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16302 ms. Remains : 98/98 places, 111/111 transitions.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-28 20:27:19] [INFO ] Invariant cache hit.
[2024-05-28 20:27:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 20:27:19] [INFO ] Invariant cache hit.
[2024-05-28 20:27:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 20:27:19] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-28 20:27:19] [INFO ] Invariant cache hit.
[2024-05-28 20:27:19] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/209 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 20:27:24] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 17520ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 17521ms
Finished structural reductions in LTL mode , in 1 iterations and 17822 ms. Remains : 98/98 places, 111/111 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 finished in 133530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((!p1||G(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 218
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 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 31 place count 149 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 134 transition count 201
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 134 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 134 transition count 194
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 122 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 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 101 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 113 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 113 transition count 152
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 110 transition count 149
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 110 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 109 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 107 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 107 transition count 144
Applied a total of 134 rules in 18 ms. Remains 107 /164 variables (removed 57) and now considering 144/365 (removed 221) transitions.
// Phase 1: matrix 144 rows 107 cols
[2024-05-28 20:27:37] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:27:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 20:27:38] [INFO ] Invariant cache hit.
[2024-05-28 20:27:38] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 20:27:38] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-28 20:27:38] [INFO ] Invariant cache hit.
[2024-05-28 20:27:38] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 5 (OVERLAPS) 144/251 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 70/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 181 constraints, problems are : Problem set: 3 solved, 140 unsolved in 6398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 144/250 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 70/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 18/198 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/251 variables, 1/199 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 122/321 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 0/251 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 321 constraints, problems are : Problem set: 3 solved, 140 unsolved in 12475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 19009ms problems are : Problem set: 3 solved, 140 unsolved
Search for dead transitions found 3 dead transitions in 19011ms
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 LI_LTL mode, iteration 1 : 107/164 places, 141/365 transitions.
Graph (complete) has 352 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 5 ms. Remains 104 /107 variables (removed 3) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 20:27:57] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 20:27:57] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 20:27:57] [INFO ] Invariant cache hit.
[2024-05-28 20:27:57] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:27:57] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 104/164 places, 141/365 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 20064 ms. Remains : 104/164 places, 141/365 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
Product exploration explored 100000 steps with 22426 reset in 243 ms.
Product exploration explored 100000 steps with 22439 reset in 268 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8900 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2841 steps, run visited all 1 properties in 12 ms. (steps per millisecond=236 )
Probabilistic random walk after 2841 steps, saw 1370 distinct states, run finished after 13 ms. (steps per millisecond=218 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 20:27:59] [INFO ] Invariant cache hit.
[2024-05-28 20:27:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 20:27:59] [INFO ] Invariant cache hit.
[2024-05-28 20:27:59] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:27:59] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-28 20:27:59] [INFO ] Invariant cache hit.
[2024-05-28 20:27:59] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 13056ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 13061ms
Finished structural reductions in LTL mode , in 1 iterations and 13553 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8885 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1881 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2841 steps, run visited all 1 properties in 12 ms. (steps per millisecond=236 )
Probabilistic random walk after 2841 steps, saw 1370 distinct states, run finished after 13 ms. (steps per millisecond=218 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22337 reset in 251 ms.
Product exploration explored 100000 steps with 22429 reset in 273 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 20:28:14] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 20:28:14] [INFO ] Invariant cache hit.
[2024-05-28 20:28:14] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 14028ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14043 ms. Remains : 104/104 places, 141/141 transitions.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-28 20:28:28] [INFO ] Invariant cache hit.
[2024-05-28 20:28:28] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 20:28:28] [INFO ] Invariant cache hit.
[2024-05-28 20:28:28] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 20:28:28] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-28 20:28:28] [INFO ] Invariant cache hit.
[2024-05-28 20:28:28] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 12885ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 12887ms
Finished structural reductions in LTL mode , in 1 iterations and 13302 ms. Remains : 104/104 places, 141/141 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 finished in 64294 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)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-15
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 148 transition count 193
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 148 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 148 transition count 191
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 50 place count 132 transition count 174
Iterating global reduction 1 with 16 rules applied. Total rules applied 66 place count 132 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 132 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 119 transition count 142
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 119 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 108 place count 119 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 114 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 114 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 123 place count 109 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 128 place count 109 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 106 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 106 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 106 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 103 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 103 transition count 116
Applied a total of 142 rules in 14 ms. Remains 103 /164 variables (removed 61) and now considering 116/365 (removed 249) transitions.
// Phase 1: matrix 116 rows 103 cols
[2024-05-28 20:28:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:28:42] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 20:28:42] [INFO ] Invariant cache hit.
[2024-05-28 20:28:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 20:28:42] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-28 20:28:42] [INFO ] Invariant cache hit.
[2024-05-28 20:28:42] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 5 (OVERLAPS) 116/219 variables, 103/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 45/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
[2024-05-28 20:28:46] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/219 variables, 1/153 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 153 constraints, problems are : Problem set: 3 solved, 112 unsolved in 5835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 2/102 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 116/218 variables, 102/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 45/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 17/169 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 1/219 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 95/265 constraints. Problems are: Problem set: 3 solved, 112 unsolved
[2024-05-28 20:28:52] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 1/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 16 (OVERLAPS) 0/219 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 266 constraints, problems are : Problem set: 3 solved, 112 unsolved in 10400 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 112/115 constraints, Known Traps: 2/2 constraints]
After SMT, in 16332ms problems are : Problem set: 3 solved, 112 unsolved
Search for dead transitions found 3 dead transitions in 16334ms
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 LI_LTL mode, iteration 1 : 103/164 places, 113/365 transitions.
Graph (complete) has 319 edges and 103 vertex of which 100 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 100 /103 variables (removed 3) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 20:28:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:28:59] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 20:28:59] [INFO ] Invariant cache hit.
[2024-05-28 20:28:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 20:28:59] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 100/164 places, 113/365 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 17249 ms. Remains : 100/164 places, 113/365 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-15
Product exploration explored 100000 steps with 22365 reset in 118 ms.
Product exploration explored 100000 steps with 22454 reset in 129 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 317 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8968 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1899999 steps, run timeout after 3001 ms. (steps per millisecond=633 ) properties seen :0 out of 1
Probabilistic random walk after 1899999 steps, saw 886215 distinct states, run finished after 3001 ms. (steps per millisecond=633 ) properties seen :0
[2024-05-28 20:29:02] [INFO ] Invariant cache hit.
[2024-05-28 20:29:02] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/174 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 29/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 39/213 variables, 24/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/174 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 29/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/213 variables, 24/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Graph (complete) has 283 edges and 100 vertex of which 99 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 99 transition count 111
Applied a total of 3 rules in 4 ms. Remains 99 /100 variables (removed 1) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 99/100 places, 111/113 transitions.
RANDOM walk for 40000 steps (8947 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1820 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2145733 steps, run timeout after 3001 ms. (steps per millisecond=715 ) properties seen :0 out of 1
Probabilistic random walk after 2145733 steps, saw 1000988 distinct states, run finished after 3002 ms. (steps per millisecond=714 ) properties seen :0
// Phase 1: matrix 111 rows 99 cols
[2024-05-28 20:29:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:29:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/158 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 52/210 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:29:06] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/158 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/210 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/210 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 99/99 places, 111/111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-28 20:29:07] [INFO ] Invariant cache hit.
[2024-05-28 20:29:07] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 20:29:07] [INFO ] Invariant cache hit.
[2024-05-28 20:29:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 20:29:07] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-28 20:29:07] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-28 20:29:07] [INFO ] Invariant cache hit.
[2024-05-28 20:29:07] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/210 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 144 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/210 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 110/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 20:29:14] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 255 constraints, problems are : Problem set: 2 solved, 108 unsolved in 8234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 12699ms problems are : Problem set: 2 solved, 108 unsolved
Search for dead transitions found 2 dead transitions in 12700ms
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 REACHABILITY mode, iteration 1 : 99/99 places, 109/111 transitions.
Graph (complete) has 277 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 97 /99 variables (removed 2) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 20:29:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 20:29:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 20:29:20] [INFO ] Invariant cache hit.
[2024-05-28 20:29:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:29:20] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/99 places, 109/111 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13408 ms. Remains : 97/99 places, 109/111 transitions.
RANDOM walk for 40000 steps (8964 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1802 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2187860 steps, run timeout after 3001 ms. (steps per millisecond=729 ) properties seen :0 out of 1
Probabilistic random walk after 2187860 steps, saw 1019309 distinct states, run finished after 3001 ms. (steps per millisecond=729 ) properties seen :0
[2024-05-28 20:29:23] [INFO ] Invariant cache hit.
[2024-05-28 20:29:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/206 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 20:29:24] [INFO ] Invariant cache hit.
[2024-05-28 20:29:24] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 20:29:24] [INFO ] Invariant cache hit.
[2024-05-28 20:29:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:29:24] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-28 20:29:24] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 20:29:24] [INFO ] Invariant cache hit.
[2024-05-28 20:29:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 108/248 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 20:29:30] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 11401ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11819 ms. Remains : 97/97 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 97 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 91 transition count 102
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 91 transition count 86
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 75 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 71 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 55 place count 70 transition count 90
Applied a total of 55 rules in 14 ms. Remains 70 /97 variables (removed 27) and now considering 90/109 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 70 cols
[2024-05-28 20:29:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:29:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:29:36] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:29:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:29:36] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:29:36] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:29:36] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 216 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 100 cols
[2024-05-28 20:29:36] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:29:36] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 20:29:36] [INFO ] Invariant cache hit.
[2024-05-28 20:29:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 20:29:37] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 20:29:37] [INFO ] Invariant cache hit.
[2024-05-28 20:29:37] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 20:29:39] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/213 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 149 constraints, problems are : Problem set: 2 solved, 110 unsolved in 5144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 3/100 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 113/213 variables, 100/105 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 44/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 110/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 259 constraints, problems are : Problem set: 2 solved, 110 unsolved in 5764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 110/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 11014ms problems are : Problem set: 2 solved, 110 unsolved
Search for dead transitions found 2 dead transitions in 11017ms
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 : 100/100 places, 111/113 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 111
Applied a total of 2 rules in 2 ms. Remains 98 /100 variables (removed 2) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 98 cols
[2024-05-28 20:29:48] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:29:48] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 20:29:48] [INFO ] Invariant cache hit.
[2024-05-28 20:29:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 20:29:48] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/100 places, 111/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11693 ms. Remains : 98/100 places, 111/113 transitions.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 310 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8880 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1847 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2152651 steps, run timeout after 3001 ms. (steps per millisecond=717 ) properties seen :0 out of 1
Probabilistic random walk after 2152651 steps, saw 1003893 distinct states, run finished after 3001 ms. (steps per millisecond=717 ) properties seen :0
[2024-05-28 20:29:51] [INFO ] Invariant cache hit.
[2024-05-28 20:29:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/165 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/209 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/165 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/209 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 320 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 111/111 transitions.
Graph (complete) has 277 edges and 98 vertex of which 97 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 97 transition count 109
Applied a total of 3 rules in 4 ms. Remains 97 /98 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/98 places, 109/111 transitions.
RANDOM walk for 40000 steps (9033 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1927 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2171136 steps, run timeout after 3001 ms. (steps per millisecond=723 ) properties seen :0 out of 1
Probabilistic random walk after 2171136 steps, saw 1012109 distinct states, run finished after 3001 ms. (steps per millisecond=723 ) properties seen :0
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 20:29:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 20:29:55] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/206 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 309ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 20:29:56] [INFO ] Invariant cache hit.
[2024-05-28 20:29:56] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 20:29:56] [INFO ] Invariant cache hit.
[2024-05-28 20:29:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 20:29:56] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-28 20:29:56] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 20:29:56] [INFO ] Invariant cache hit.
[2024-05-28 20:29:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 108/248 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 20:30:01] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 12355ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12678 ms. Remains : 97/97 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 97 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 91 transition count 102
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 91 transition count 86
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 75 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 71 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 55 place count 70 transition count 90
Applied a total of 55 rules in 9 ms. Remains 70 /97 variables (removed 27) and now considering 90/109 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 70 cols
[2024-05-28 20:30:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:30:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:30:08] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:30:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 20:30:08] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:30:09] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:30:09] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 203 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22534 reset in 116 ms.
Product exploration explored 100000 steps with 22358 reset in 127 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-28 20:30:10] [INFO ] Redundant transitions in 0 ms returned []
Running 110 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 98 cols
[2024-05-28 20:30:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:30:10] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/209 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 20:30:13] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 12123ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12133 ms. Remains : 98/98 places, 111/111 transitions.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-28 20:30:22] [INFO ] Invariant cache hit.
[2024-05-28 20:30:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 20:30:22] [INFO ] Invariant cache hit.
[2024-05-28 20:30:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 20:30:22] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-28 20:30:22] [INFO ] Invariant cache hit.
[2024-05-28 20:30:22] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/209 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 20:30:25] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 11988ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 11989ms
Finished structural reductions in LTL mode , in 1 iterations and 12299 ms. Remains : 98/98 places, 111/111 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 finished in 112719 ms.
[2024-05-28 20:30:34] [INFO ] Flatten gal took : 29 ms
[2024-05-28 20:30:34] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 20:30:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 365 transitions and 1444 arcs took 11 ms.
Total runtime 954034 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m64

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 164
TRANSITIONS: 365
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.004s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 2745
MODEL NAME: /home/mcc/execution/415/model
164 places, 365 transitions.

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

BK_STOP 1716929210736

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m64"
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-d2m64, 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-171683809800132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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