About the Execution of LTSMin+red for Anderson-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1557.611 | 895384.00 | 1516045.00 | 1754.60 | FFFTTFFF?FFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118400364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717259255687
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:27:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:27:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:27:38] [INFO ] Load time of PNML (sax parser for PT used): 467 ms
[2024-06-01 16:27:38] [INFO ] Transformed 621 places.
[2024-06-01 16:27:38] [INFO ] Transformed 2480 transitions.
[2024-06-01 16:27:38] [INFO ] Found NUPN structural information;
[2024-06-01 16:27:38] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 711 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 154 places :
Symmetric choice reduction at 0 with 154 rule applications. Total rules 154 place count 467 transition count 1120
Iterating global reduction 0 with 154 rules applied. Total rules applied 308 place count 467 transition count 1120
Applied a total of 308 rules in 229 ms. Remains 467 /621 variables (removed 154) and now considering 1120/2480 (removed 1360) transitions.
// Phase 1: matrix 1120 rows 467 cols
[2024-06-01 16:27:39] [INFO ] Computed 23 invariants in 92 ms
[2024-06-01 16:27:41] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2024-06-01 16:27:41] [INFO ] Invariant cache hit.
[2024-06-01 16:27:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:27:46] [INFO ] Implicit Places using invariants and state equation in 5067 ms returned []
Implicit Place search using SMT with State Equation took 6539 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 16:27:46] [INFO ] Invariant cache hit.
[2024-06-01 16:27:46] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 16:28:08] [INFO ] Deduced a trap composed of 200 places in 799 ms of which 85 ms to minimize.
[2024-06-01 16:28:08] [INFO ] Deduced a trap composed of 163 places in 613 ms of which 7 ms to minimize.
[2024-06-01 16:28:09] [INFO ] Deduced a trap composed of 161 places in 552 ms of which 7 ms to minimize.
[2024-06-01 16:28:10] [INFO ] Deduced a trap composed of 207 places in 617 ms of which 7 ms to minimize.
[2024-06-01 16:28:10] [INFO ] Deduced a trap composed of 211 places in 542 ms of which 6 ms to minimize.
[2024-06-01 16:28:11] [INFO ] Deduced a trap composed of 275 places in 597 ms of which 7 ms to minimize.
[2024-06-01 16:28:12] [INFO ] Deduced a trap composed of 203 places in 565 ms of which 8 ms to minimize.
[2024-06-01 16:28:12] [INFO ] Deduced a trap composed of 290 places in 620 ms of which 7 ms to minimize.
[2024-06-01 16:28:13] [INFO ] Deduced a trap composed of 215 places in 605 ms of which 7 ms to minimize.
[2024-06-01 16:28:14] [INFO ] Deduced a trap composed of 319 places in 638 ms of which 8 ms to minimize.
[2024-06-01 16:28:14] [INFO ] Deduced a trap composed of 88 places in 635 ms of which 7 ms to minimize.
[2024-06-01 16:28:15] [INFO ] Deduced a trap composed of 284 places in 673 ms of which 7 ms to minimize.
[2024-06-01 16:28:16] [INFO ] Deduced a trap composed of 191 places in 739 ms of which 8 ms to minimize.
[2024-06-01 16:28:16] [INFO ] Deduced a trap composed of 117 places in 669 ms of which 8 ms to minimize.
[2024-06-01 16:28:17] [INFO ] Deduced a trap composed of 269 places in 669 ms of which 7 ms to minimize.
[2024-06-01 16:28:18] [INFO ] Deduced a trap composed of 116 places in 571 ms of which 7 ms to minimize.
[2024-06-01 16:28:18] [INFO ] Deduced a trap composed of 265 places in 665 ms of which 8 ms to minimize.
SMT process timed out in 32591ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 32666ms
Starting structural reductions in LTL mode, iteration 1 : 467/621 places, 1120/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39524 ms. Remains : 467/621 places, 1120/2480 transitions.
Support contains 50 out of 467 places after structural reductions.
[2024-06-01 16:28:19] [INFO ] Flatten gal took : 268 ms
[2024-06-01 16:28:19] [INFO ] Flatten gal took : 175 ms
[2024-06-01 16:28:19] [INFO ] Input system was already deterministic with 1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 2829 ms. (14 steps per ms) remains 23/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
[2024-06-01 16:28:20] [INFO ] Invariant cache hit.
[2024-06-01 16:28:20] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 375/404 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 20/424 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 34/458 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 9/467 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1120/1587 variables, 467/490 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1587 variables, 90/580 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1587 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/1587 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1587/1587 variables, and 580 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3424 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 467/467 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 375/404 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 20/424 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 34/458 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 8 (OVERLAPS) 9/467 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-01 16:28:26] [INFO ] Deduced a trap composed of 197 places in 462 ms of which 5 ms to minimize.
[2024-06-01 16:28:26] [INFO ] Deduced a trap composed of 106 places in 623 ms of which 5 ms to minimize.
[2024-06-01 16:28:27] [INFO ] Deduced a trap composed of 169 places in 635 ms of which 8 ms to minimize.
[2024-06-01 16:28:28] [INFO ] Deduced a trap composed of 216 places in 702 ms of which 5 ms to minimize.
[2024-06-01 16:28:29] [INFO ] Deduced a trap composed of 281 places in 614 ms of which 6 ms to minimize.
[2024-06-01 16:28:29] [INFO ] Deduced a trap composed of 59 places in 650 ms of which 8 ms to minimize.
SMT process timed out in 8794ms, After SMT, problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 467 transition count 1031
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 378 transition count 1031
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 190 place count 366 transition count 839
Iterating global reduction 0 with 12 rules applied. Total rules applied 202 place count 366 transition count 839
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 365 transition count 838
Applied a total of 204 rules in 232 ms. Remains 365 /467 variables (removed 102) and now considering 838/1120 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 365/467 places, 838/1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 897 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 357 ms. (111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/7 properties
// Phase 1: matrix 838 rows 365 cols
[2024-06-01 16:28:31] [INFO ] Computed 23 invariants in 22 ms
[2024-06-01 16:28:31] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 329/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/355 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 10/365 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 838/1203 variables, 365/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1203 variables, 90/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1203 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1203 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1203/1203 variables, and 478 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 365/365 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 329/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/355 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 10/365 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:28:33] [INFO ] Deduced a trap composed of 78 places in 509 ms of which 6 ms to minimize.
[2024-06-01 16:28:33] [INFO ] Deduced a trap composed of 141 places in 476 ms of which 6 ms to minimize.
[2024-06-01 16:28:34] [INFO ] Deduced a trap composed of 130 places in 593 ms of which 6 ms to minimize.
[2024-06-01 16:28:34] [INFO ] Deduced a trap composed of 94 places in 512 ms of which 6 ms to minimize.
[2024-06-01 16:28:35] [INFO ] Deduced a trap composed of 73 places in 518 ms of which 6 ms to minimize.
[2024-06-01 16:28:35] [INFO ] Deduced a trap composed of 82 places in 413 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:28:36] [INFO ] Deduced a trap composed of 136 places in 498 ms of which 6 ms to minimize.
[2024-06-01 16:28:37] [INFO ] Deduced a trap composed of 101 places in 518 ms of which 6 ms to minimize.
[2024-06-01 16:28:37] [INFO ] Deduced a trap composed of 60 places in 504 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 838/1203 variables, 365/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1203 variables, 90/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1203 variables, 6/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1203 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1203 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1203/1203 variables, and 493 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 365/365 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 11319ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 12 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 838/838 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 359 transition count 724
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 359 transition count 724
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 358 transition count 723
Applied a total of 14 rules in 75 ms. Remains 358 /365 variables (removed 7) and now considering 723/838 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 358/365 places, 723/838 transitions.
RANDOM walk for 40000 steps (8 resets) in 331 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
// Phase 1: matrix 723 rows 358 cols
[2024-06-01 16:28:42] [INFO ] Computed 23 invariants in 13 ms
[2024-06-01 16:28:42] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 325/332 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/348 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/358 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:28:43] [INFO ] Deduced a trap composed of 85 places in 243 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:28:43] [INFO ] Deduced a trap composed of 82 places in 375 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:28:44] [INFO ] Deduced a trap composed of 90 places in 460 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 723/1081 variables, 358/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 90/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1081 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1081 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 474 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 358/358 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 325/332 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/348 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/358 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 723/1081 variables, 358/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 90/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1081 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 477 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2118 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 358/358 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 4629ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1117 ms.
Support contains 7 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 723/723 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 355 transition count 666
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 355 transition count 666
Applied a total of 6 rules in 40 ms. Remains 355 /358 variables (removed 3) and now considering 666/723 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 355/358 places, 666/723 transitions.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 240146 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 3
Probabilistic random walk after 240146 steps, saw 183604 distinct states, run finished after 3009 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 666 rows 355 cols
[2024-06-01 16:28:52] [INFO ] Computed 23 invariants in 10 ms
[2024-06-01 16:28:52] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 322/329 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/345 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/355 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 184 places in 377 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 80 places in 465 ms of which 6 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 60 places in 457 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 666/1021 variables, 355/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1021 variables, 90/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1021 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1021 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 355/355 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 322/329 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/345 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/355 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 666/1021 variables, 355/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1021 variables, 90/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1021 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1021 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1021 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 474 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2193 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 355/355 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 5033ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 695 ms.
Support contains 7 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 666/666 transitions.
Applied a total of 0 rules in 35 ms. Remains 355 /355 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 355/355 places, 666/666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 666/666 transitions.
Applied a total of 0 rules in 34 ms. Remains 355 /355 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-06-01 16:28:57] [INFO ] Invariant cache hit.
[2024-06-01 16:28:58] [INFO ] Implicit Places using invariants in 984 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 987 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/355 places, 666/666 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 354 transition count 570
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 258 transition count 570
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 196 place count 258 transition count 566
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 200 place count 254 transition count 566
Applied a total of 200 rules in 64 ms. Remains 254 /354 variables (removed 100) and now considering 566/666 (removed 100) transitions.
// Phase 1: matrix 566 rows 254 cols
[2024-06-01 16:28:58] [INFO ] Computed 22 invariants in 9 ms
[2024-06-01 16:28:59] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-01 16:28:59] [INFO ] Invariant cache hit.
[2024-06-01 16:28:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:29:00] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 254/355 places, 566/666 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3127 ms. Remains : 254/355 places, 566/666 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 285777 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :1 out of 3
Probabilistic random walk after 285777 steps, saw 212596 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :1
[2024-06-01 16:29:04] [INFO ] Invariant cache hit.
[2024-06-01 16:29:04] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/235 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/253 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/254 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 566/820 variables, 254/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 90/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/820 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/235 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/253 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/254 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:29:05] [INFO ] Deduced a trap composed of 51 places in 305 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 566/820 variables, 254/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 90/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/820 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 369 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1843ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 205 ms.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 253 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 253 transition count 547
Applied a total of 2 rules in 25 ms. Remains 253 /254 variables (removed 1) and now considering 547/566 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 253/254 places, 547/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 314868 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 314868 steps, saw 235614 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
// Phase 1: matrix 547 rows 253 cols
[2024-06-01 16:29:09] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:29:09] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 221/227 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/234 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/252 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 547/800 variables, 253/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/800 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 221/227 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/234 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/252 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:29:10] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:29:10] [INFO ] Deduced a trap composed of 72 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:29:11] [INFO ] Deduced a trap composed of 47 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:29:11] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:29:11] [INFO ] Deduced a trap composed of 89 places in 279 ms of which 5 ms to minimize.
[2024-06-01 16:29:12] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:29:12] [INFO ] Deduced a trap composed of 111 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:29:12] [INFO ] Deduced a trap composed of 94 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:29:13] [INFO ] Deduced a trap composed of 88 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:29:13] [INFO ] Deduced a trap composed of 92 places in 342 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:29:13] [INFO ] Deduced a trap composed of 69 places in 371 ms of which 5 ms to minimize.
[2024-06-01 16:29:14] [INFO ] Deduced a trap composed of 57 places in 353 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 547/800 variables, 253/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 90/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/800 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5564 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 6174ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 253 /253 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 253/253 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 253 /253 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-06-01 16:29:15] [INFO ] Invariant cache hit.
[2024-06-01 16:29:16] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-06-01 16:29:16] [INFO ] Invariant cache hit.
[2024-06-01 16:29:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:29:18] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
[2024-06-01 16:29:18] [INFO ] Redundant transitions in 54 ms returned []
Running 537 sub problems to find dead transitions.
[2024-06-01 16:29:18] [INFO ] Invariant cache hit.
[2024-06-01 16:29:18] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 112 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 120 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 91 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 109 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 101 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 102 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 88 places in 286 ms of which 7 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 103 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 101 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 97 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 77 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:29:30] [INFO ] Deduced a trap composed of 86 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:29:30] [INFO ] Deduced a trap composed of 90 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:29:30] [INFO ] Deduced a trap composed of 83 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 87 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 71 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 69 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 83 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 5 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 96 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 67 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:29:39] [INFO ] Deduced a trap composed of 97 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:29:39] [INFO ] Deduced a trap composed of 56 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:29:40] [INFO ] Deduced a trap composed of 71 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:29:41] [INFO ] Deduced a trap composed of 59 places in 305 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 253/800 variables, and 62 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/253 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/800 variables, and 62 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/253 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/537 constraints, Known Traps: 40/40 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63569 ms. Remains : 253/253 places, 547/547 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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((!X(p0) U p1)))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 19 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-06-01 16:30:19] [INFO ] Computed 23 invariants in 11 ms
[2024-06-01 16:30:20] [INFO ] Implicit Places using invariants in 1031 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1033 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 25 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1078 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : Anderson-PT-10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 15328 steps with 0 reset in 205 ms.
FORMULA Anderson-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-00 finished in 1756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 53 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-06-01 16:30:21] [INFO ] Computed 23 invariants in 10 ms
[2024-06-01 16:30:22] [INFO ] Implicit Places using invariants in 826 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 829 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 22 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 905 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-01 finished in 1124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(X(F(p0)))) U G(!p1)))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 681
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 681
Applied a total of 50 rules in 71 ms. Remains 442 /467 variables (removed 25) and now considering 681/1120 (removed 439) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-06-01 16:30:22] [INFO ] Computed 23 invariants in 10 ms
[2024-06-01 16:30:23] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-06-01 16:30:23] [INFO ] Invariant cache hit.
[2024-06-01 16:30:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:30:25] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned []
Implicit Place search using SMT with State Equation took 3537 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-06-01 16:30:26] [INFO ] Invariant cache hit.
[2024-06-01 16:30:26] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:30:40] [INFO ] Deduced a trap composed of 172 places in 467 ms of which 7 ms to minimize.
[2024-06-01 16:30:40] [INFO ] Deduced a trap composed of 140 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:30:41] [INFO ] Deduced a trap composed of 133 places in 397 ms of which 6 ms to minimize.
[2024-06-01 16:30:41] [INFO ] Deduced a trap composed of 130 places in 369 ms of which 4 ms to minimize.
[2024-06-01 16:30:42] [INFO ] Deduced a trap composed of 155 places in 464 ms of which 6 ms to minimize.
[2024-06-01 16:30:42] [INFO ] Deduced a trap composed of 217 places in 350 ms of which 4 ms to minimize.
[2024-06-01 16:30:43] [INFO ] Deduced a trap composed of 138 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:30:43] [INFO ] Deduced a trap composed of 98 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 97 places in 462 ms of which 7 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 123 places in 461 ms of which 5 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 171 places in 459 ms of which 7 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 148 places in 444 ms of which 6 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 189 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:30:46] [INFO ] Deduced a trap composed of 144 places in 459 ms of which 7 ms to minimize.
[2024-06-01 16:30:46] [INFO ] Deduced a trap composed of 175 places in 482 ms of which 4 ms to minimize.
[2024-06-01 16:30:47] [INFO ] Deduced a trap composed of 138 places in 355 ms of which 4 ms to minimize.
[2024-06-01 16:30:47] [INFO ] Deduced a trap composed of 141 places in 466 ms of which 7 ms to minimize.
[2024-06-01 16:30:48] [INFO ] Deduced a trap composed of 98 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:30:48] [INFO ] Deduced a trap composed of 171 places in 471 ms of which 7 ms to minimize.
[2024-06-01 16:30:48] [INFO ] Deduced a trap composed of 101 places in 389 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:30:52] [INFO ] Deduced a trap composed of 216 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:30:52] [INFO ] Deduced a trap composed of 123 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:30:53] [INFO ] Deduced a trap composed of 133 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:30:53] [INFO ] Deduced a trap composed of 250 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:30:53] [INFO ] Deduced a trap composed of 141 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:30:54] [INFO ] Deduced a trap composed of 144 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:30:54] [INFO ] Deduced a trap composed of 177 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:30:54] [INFO ] Deduced a trap composed of 167 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:30:55] [INFO ] Deduced a trap composed of 190 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:30:55] [INFO ] Deduced a trap composed of 173 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:30:56] [INFO ] Deduced a trap composed of 156 places in 455 ms of which 6 ms to minimize.
[2024-06-01 16:30:56] [INFO ] Deduced a trap composed of 138 places in 352 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1123 variables, and 54 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 32/54 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 180 places in 522 ms of which 7 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 153 places in 538 ms of which 7 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 258 places in 545 ms of which 7 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 107 places in 530 ms of which 6 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 163 places in 529 ms of which 7 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 125 places in 543 ms of which 7 ms to minimize.
[2024-06-01 16:31:11] [INFO ] Deduced a trap composed of 223 places in 537 ms of which 7 ms to minimize.
[2024-06-01 16:31:11] [INFO ] Deduced a trap composed of 98 places in 536 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/1123 variables, and 62 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 40/40 constraints]
After SMT, in 60709ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60717ms
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 681/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64329 ms. Remains : 442/467 places, 681/1120 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 437 ms.
Product exploration explored 100000 steps with 0 reset in 637 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 149 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 346 ms. (115 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 305 ms. (130 steps per ms) remains 1/3 properties
[2024-06-01 16:31:28] [INFO ] Invariant cache hit.
[2024-06-01 16:31:28] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 425/1123 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 5/12 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 550 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 281 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 22 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-06-01 16:31:30] [INFO ] Invariant cache hit.
[2024-06-01 16:31:30] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-06-01 16:31:30] [INFO ] Invariant cache hit.
[2024-06-01 16:31:31] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:31:34] [INFO ] Implicit Places using invariants and state equation in 3845 ms returned []
Implicit Place search using SMT with State Equation took 4675 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-06-01 16:31:34] [INFO ] Invariant cache hit.
[2024-06-01 16:31:34] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 172 places in 470 ms of which 6 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 140 places in 490 ms of which 6 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 133 places in 533 ms of which 7 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 130 places in 563 ms of which 7 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 155 places in 568 ms of which 7 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 217 places in 549 ms of which 7 ms to minimize.
[2024-06-01 16:31:51] [INFO ] Deduced a trap composed of 138 places in 535 ms of which 7 ms to minimize.
[2024-06-01 16:31:51] [INFO ] Deduced a trap composed of 98 places in 453 ms of which 7 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 97 places in 547 ms of which 7 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 123 places in 547 ms of which 7 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 171 places in 567 ms of which 7 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 148 places in 540 ms of which 7 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 189 places in 536 ms of which 7 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 144 places in 555 ms of which 7 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 175 places in 495 ms of which 7 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 138 places in 566 ms of which 7 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 141 places in 544 ms of which 7 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 98 places in 534 ms of which 7 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 171 places in 539 ms of which 7 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 101 places in 553 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 216 places in 562 ms of which 6 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Deduced a trap composed of 123 places in 553 ms of which 6 ms to minimize.
[2024-06-01 16:32:05] [INFO ] Deduced a trap composed of 133 places in 580 ms of which 7 ms to minimize.
[2024-06-01 16:32:06] [INFO ] Deduced a trap composed of 250 places in 545 ms of which 7 ms to minimize.
SMT process timed out in 31298ms, After SMT, problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 31311ms
Finished structural reductions in LTL mode , in 1 iterations and 36012 ms. Remains : 442/442 places, 681/681 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 167 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 1/4 properties
BEST_FIRST walk for 27393 steps (5 resets) in 69 ms. (391 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 357 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 286 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 507 ms.
Applying partial POR strategy [true, false, true, false, true, false]
Stuttering acceptance computed with spot in 240 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 442 transition count 681
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 0 with 89 rules applied. Total rules applied 89 place count 442 transition count 681
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 442 transition count 681
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 90 rules in 116 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-06-01 16:32:09] [INFO ] Redundant transitions in 14 ms returned []
Running 671 sub problems to find dead transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-06-01 16:32:09] [INFO ] Computed 23 invariants in 12 ms
[2024-06-01 16:32:09] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:32:21] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:32:21] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:32:21] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:32:22] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-06-01 16:32:22] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:32:22] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-06-01 16:32:22] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:32:22] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:32:23] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:32:23] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-06-01 16:32:25] [INFO ] Deduced a trap composed of 91 places in 571 ms of which 7 ms to minimize.
[2024-06-01 16:32:26] [INFO ] Deduced a trap composed of 193 places in 533 ms of which 7 ms to minimize.
[2024-06-01 16:32:27] [INFO ] Deduced a trap composed of 155 places in 561 ms of which 7 ms to minimize.
[2024-06-01 16:32:27] [INFO ] Deduced a trap composed of 110 places in 557 ms of which 6 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 163 places in 511 ms of which 7 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 107 places in 531 ms of which 6 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 106 places in 526 ms of which 6 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 150 places in 510 ms of which 7 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 95 places in 564 ms of which 6 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 132 places in 494 ms of which 7 ms to minimize.
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 90 solved, 581 unsolved
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 124 places in 563 ms of which 7 ms to minimize.
[2024-06-01 16:32:39] [INFO ] Deduced a trap composed of 102 places in 547 ms of which 7 ms to minimize.
[2024-06-01 16:32:39] [INFO ] Deduced a trap composed of 79 places in 510 ms of which 6 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 207 places in 553 ms of which 7 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 187 places in 553 ms of which 7 ms to minimize.
SMT process timed out in 31477ms, After SMT, problems are : Problem set: 90 solved, 581 unsolved
Search for dead transitions found 90 dead transitions in 31490ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 442/442 places, 591/681 transitions.
Graph (complete) has 1561 edges and 442 vertex of which 352 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.7 ms
Discarding 90 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 352 /442 variables (removed 90) and now considering 591/591 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/442 places, 591/681 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31688 ms. Remains : 352/442 places, 591/681 transitions.
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 19 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-06-01 16:32:41] [INFO ] Computed 23 invariants in 15 ms
[2024-06-01 16:32:41] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-06-01 16:32:41] [INFO ] Invariant cache hit.
[2024-06-01 16:32:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:32:44] [INFO ] Implicit Places using invariants and state equation in 3042 ms returned []
Implicit Place search using SMT with State Equation took 3801 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-06-01 16:32:44] [INFO ] Invariant cache hit.
[2024-06-01 16:32:44] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-01 16:33:00] [INFO ] Deduced a trap composed of 172 places in 566 ms of which 7 ms to minimize.
[2024-06-01 16:33:00] [INFO ] Deduced a trap composed of 140 places in 533 ms of which 6 ms to minimize.
[2024-06-01 16:33:01] [INFO ] Deduced a trap composed of 133 places in 518 ms of which 6 ms to minimize.
[2024-06-01 16:33:02] [INFO ] Deduced a trap composed of 130 places in 539 ms of which 7 ms to minimize.
[2024-06-01 16:33:02] [INFO ] Deduced a trap composed of 155 places in 530 ms of which 7 ms to minimize.
[2024-06-01 16:33:03] [INFO ] Deduced a trap composed of 217 places in 533 ms of which 7 ms to minimize.
[2024-06-01 16:33:03] [INFO ] Deduced a trap composed of 138 places in 547 ms of which 7 ms to minimize.
[2024-06-01 16:33:04] [INFO ] Deduced a trap composed of 98 places in 572 ms of which 7 ms to minimize.
[2024-06-01 16:33:05] [INFO ] Deduced a trap composed of 97 places in 535 ms of which 6 ms to minimize.
[2024-06-01 16:33:05] [INFO ] Deduced a trap composed of 123 places in 537 ms of which 7 ms to minimize.
[2024-06-01 16:33:06] [INFO ] Deduced a trap composed of 171 places in 537 ms of which 7 ms to minimize.
[2024-06-01 16:33:06] [INFO ] Deduced a trap composed of 148 places in 485 ms of which 7 ms to minimize.
[2024-06-01 16:33:07] [INFO ] Deduced a trap composed of 189 places in 534 ms of which 7 ms to minimize.
[2024-06-01 16:33:07] [INFO ] Deduced a trap composed of 144 places in 504 ms of which 7 ms to minimize.
[2024-06-01 16:33:08] [INFO ] Deduced a trap composed of 175 places in 535 ms of which 7 ms to minimize.
[2024-06-01 16:33:08] [INFO ] Deduced a trap composed of 138 places in 503 ms of which 7 ms to minimize.
[2024-06-01 16:33:09] [INFO ] Deduced a trap composed of 141 places in 536 ms of which 7 ms to minimize.
[2024-06-01 16:33:10] [INFO ] Deduced a trap composed of 98 places in 552 ms of which 7 ms to minimize.
[2024-06-01 16:33:10] [INFO ] Deduced a trap composed of 171 places in 571 ms of which 7 ms to minimize.
[2024-06-01 16:33:11] [INFO ] Deduced a trap composed of 101 places in 567 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1123 variables, and 42 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/1123 variables, and 42 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 20/20 constraints]
After SMT, in 60891ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60898ms
Finished structural reductions in LTL mode , in 1 iterations and 64721 ms. Remains : 442/442 places, 681/681 transitions.
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 203575 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)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 20 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-06-01 16:33:45] [INFO ] Computed 23 invariants in 11 ms
[2024-06-01 16:33:46] [INFO ] Implicit Places using invariants in 930 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 934 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 14 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 969 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-03 finished in 1890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||G(p2))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 700
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 700
Applied a total of 48 rules in 18 ms. Remains 443 /467 variables (removed 24) and now considering 700/1120 (removed 420) transitions.
// Phase 1: matrix 700 rows 443 cols
[2024-06-01 16:33:47] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 16:33:48] [INFO ] Implicit Places using invariants in 773 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 774 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 700/1120 transitions.
Applied a total of 0 rules in 14 ms. Remains 442 /442 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 809 ms. Remains : 442/467 places, 700/1120 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 1926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 18 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-06-01 16:33:49] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 16:33:50] [INFO ] Implicit Places using invariants in 810 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 812 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 844 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 1022 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(((p1 U p2)&&p0)) U G(p3))))))'
Support contains 8 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 445 transition count 756
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 445 transition count 756
Applied a total of 44 rules in 30 ms. Remains 445 /467 variables (removed 22) and now considering 756/1120 (removed 364) transitions.
// Phase 1: matrix 756 rows 445 cols
[2024-06-01 16:33:50] [INFO ] Computed 23 invariants in 10 ms
[2024-06-01 16:33:51] [INFO ] Implicit Places using invariants in 1025 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1027 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/467 places, 756/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 444 /444 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1070 ms. Remains : 444/467 places, 756/1120 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (OR (AND (NOT p2) p3) (AND (NOT p0) p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-06 finished in 1569 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)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 58 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-06-01 16:33:52] [INFO ] Computed 23 invariants in 9 ms
[2024-06-01 16:33:53] [INFO ] Implicit Places using invariants in 1048 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 22 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-06-01 16:33:53] [INFO ] Computed 22 invariants in 11 ms
[2024-06-01 16:33:54] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-06-01 16:33:54] [INFO ] Invariant cache hit.
[2024-06-01 16:33:54] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:33:55] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3326 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 173 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 310 ms.
Product exploration explored 100000 steps with 0 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND p0 p1), p1]
RANDOM walk for 40000 steps (8 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
[2024-06-01 16:33:57] [INFO ] Invariant cache hit.
[2024-06-01 16:33:57] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:33:57] [INFO ] Deduced a trap composed of 87 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 87 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 27 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 252/254 places, 528/530 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 814666 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :0 out of 1
Probabilistic random walk after 814666 steps, saw 587210 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
// Phase 1: matrix 528 rows 252 cols
[2024-06-01 16:34:03] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 16:34:03] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 78 places in 266 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-06-01 16:34:04] [INFO ] Invariant cache hit.
[2024-06-01 16:34:05] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-06-01 16:34:05] [INFO ] Invariant cache hit.
[2024-06-01 16:34:05] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:34:06] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2024-06-01 16:34:06] [INFO ] Redundant transitions in 6 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 16:34:06] [INFO ] Invariant cache hit.
[2024-06-01 16:34:06] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 16:34:14] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:34:14] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:34:14] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:34:15] [INFO ] Deduced a trap composed of 89 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:34:15] [INFO ] Deduced a trap composed of 102 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:34:15] [INFO ] Deduced a trap composed of 98 places in 336 ms of which 4 ms to minimize.
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 98 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 99 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 104 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:34:17] [INFO ] Deduced a trap composed of 98 places in 380 ms of which 4 ms to minimize.
[2024-06-01 16:34:17] [INFO ] Deduced a trap composed of 89 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:34:18] [INFO ] Deduced a trap composed of 95 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:34:19] [INFO ] Deduced a trap composed of 83 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:34:19] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:34:20] [INFO ] Deduced a trap composed of 70 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:34:20] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:34:21] [INFO ] Deduced a trap composed of 88 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:34:21] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:34:22] [INFO ] Deduced a trap composed of 66 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:34:22] [INFO ] Deduced a trap composed of 80 places in 331 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 16:34:24] [INFO ] Deduced a trap composed of 72 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:34:25] [INFO ] Deduced a trap composed of 107 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:34:25] [INFO ] Deduced a trap composed of 102 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:34:25] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:34:25] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:34:26] [INFO ] Deduced a trap composed of 73 places in 319 ms of which 4 ms to minimize.
[2024-06-01 16:34:27] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 6 ms to minimize.
[2024-06-01 16:34:27] [INFO ] Deduced a trap composed of 60 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:34:28] [INFO ] Deduced a trap composed of 60 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:34:28] [INFO ] Deduced a trap composed of 64 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:34:28] [INFO ] Deduced a trap composed of 56 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:34:29] [INFO ] Deduced a trap composed of 63 places in 325 ms of which 3 ms to minimize.
[2024-06-01 16:34:29] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:34:29] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:34:30] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 3 ms to minimize.
[2024-06-01 16:34:30] [INFO ] Deduced a trap composed of 99 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:34:30] [INFO ] Deduced a trap composed of 87 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:34:31] [INFO ] Deduced a trap composed of 98 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:34:31] [INFO ] Deduced a trap composed of 112 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:34:31] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/780 variables, and 62 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 16:34:41] [INFO ] Deduced a trap composed of 63 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:34:43] [INFO ] Deduced a trap composed of 59 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:34:43] [INFO ] Deduced a trap composed of 72 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:34:44] [INFO ] Deduced a trap composed of 68 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:34:44] [INFO ] Deduced a trap composed of 77 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:34:45] [INFO ] Deduced a trap composed of 100 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:34:45] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:34:46] [INFO ] Deduced a trap composed of 97 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:34:46] [INFO ] Deduced a trap composed of 62 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:34:46] [INFO ] Deduced a trap composed of 67 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:34:47] [INFO ] Deduced a trap composed of 90 places in 391 ms of which 9 ms to minimize.
[2024-06-01 16:34:47] [INFO ] Deduced a trap composed of 77 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:34:47] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:34:48] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:34:48] [INFO ] Deduced a trap composed of 106 places in 359 ms of which 4 ms to minimize.
[2024-06-01 16:34:48] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:34:49] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:34:49] [INFO ] Deduced a trap composed of 104 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:34:49] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 86 places in 361 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/780 variables, and 82 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 60/60 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62928 ms. Remains : 252/252 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 11 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-06-01 16:35:07] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 16:35:07] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-06-01 16:35:07] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2024-06-01 16:35:07] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:35:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-06-01 16:35:07] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 20 ms returned sat
[2024-06-01 16:35:08] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:35:08] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:35:08] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 787 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 13 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-06-01 16:35:08] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:35:09] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-06-01 16:35:09] [INFO ] Invariant cache hit.
[2024-06-01 16:35:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:35:10] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2024-06-01 16:35:10] [INFO ] Redundant transitions in 3 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 16:35:10] [INFO ] Invariant cache hit.
[2024-06-01 16:35:10] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 16:35:16] [INFO ] Deduced a trap composed of 94 places in 274 ms of which 5 ms to minimize.
[2024-06-01 16:35:18] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:35:18] [INFO ] Deduced a trap composed of 85 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:35:18] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 4 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 75 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 112 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 92 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 81 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 83 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:35:22] [INFO ] Deduced a trap composed of 89 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:35:22] [INFO ] Deduced a trap composed of 89 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:35:22] [INFO ] Deduced a trap composed of 109 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:35:23] [INFO ] Deduced a trap composed of 90 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:35:23] [INFO ] Deduced a trap composed of 76 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:35:23] [INFO ] Deduced a trap composed of 99 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:35:24] [INFO ] Deduced a trap composed of 71 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 16:35:25] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:35:26] [INFO ] Deduced a trap composed of 78 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:35:26] [INFO ] Deduced a trap composed of 82 places in 284 ms of which 5 ms to minimize.
[2024-06-01 16:35:27] [INFO ] Deduced a trap composed of 110 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:35:27] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:35:27] [INFO ] Deduced a trap composed of 68 places in 327 ms of which 8 ms to minimize.
[2024-06-01 16:35:29] [INFO ] Deduced a trap composed of 105 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 83 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 99 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 77 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 75 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 81 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:35:32] [INFO ] Deduced a trap composed of 94 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:35:32] [INFO ] Deduced a trap composed of 63 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:35:32] [INFO ] Deduced a trap composed of 98 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:35:33] [INFO ] Deduced a trap composed of 87 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:35:33] [INFO ] Deduced a trap composed of 106 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:35:34] [INFO ] Deduced a trap composed of 89 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:35:34] [INFO ] Deduced a trap composed of 89 places in 338 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 40/40 constraints]
After SMT, in 60479ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62400 ms. Remains : 254/254 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 p1), p1]
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-06-01 16:36:11] [INFO ] Invariant cache hit.
[2024-06-01 16:36:11] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:36:11] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:36:12] [INFO ] Deduced a trap composed of 87 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:36:12] [INFO ] Deduced a trap composed of 95 places in 342 ms of which 4 ms to minimize.
[2024-06-01 16:36:12] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 26 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 252/254 places, 528/530 transitions.
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 801347 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 801347 steps, saw 577603 distinct states, run finished after 3004 ms. (steps per millisecond=266 ) properties seen :0
// Phase 1: matrix 528 rows 252 cols
[2024-06-01 16:36:17] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 16:36:17] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:36:17] [INFO ] Deduced a trap composed of 78 places in 231 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-06-01 16:36:18] [INFO ] Invariant cache hit.
[2024-06-01 16:36:18] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-06-01 16:36:18] [INFO ] Invariant cache hit.
[2024-06-01 16:36:19] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:36:19] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2024-06-01 16:36:19] [INFO ] Redundant transitions in 3 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 16:36:19] [INFO ] Invariant cache hit.
[2024-06-01 16:36:19] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 16:36:26] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:36:27] [INFO ] Deduced a trap composed of 78 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:36:27] [INFO ] Deduced a trap composed of 106 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:36:27] [INFO ] Deduced a trap composed of 89 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:36:28] [INFO ] Deduced a trap composed of 102 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:36:28] [INFO ] Deduced a trap composed of 98 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:36:28] [INFO ] Deduced a trap composed of 98 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:36:29] [INFO ] Deduced a trap composed of 99 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:36:29] [INFO ] Deduced a trap composed of 104 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:36:29] [INFO ] Deduced a trap composed of 98 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:36:30] [INFO ] Deduced a trap composed of 89 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:36:31] [INFO ] Deduced a trap composed of 95 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:36:31] [INFO ] Deduced a trap composed of 83 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:36:32] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:36:32] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:36:33] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:36:33] [INFO ] Deduced a trap composed of 88 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:36:33] [INFO ] Deduced a trap composed of 66 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:36:34] [INFO ] Deduced a trap composed of 66 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:36:34] [INFO ] Deduced a trap composed of 80 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 16:36:36] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 107 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 102 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 82 places in 306 ms of which 3 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:36:38] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:36:39] [INFO ] Deduced a trap composed of 54 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:36:39] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 6 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 60 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 64 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 56 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:36:41] [INFO ] Deduced a trap composed of 63 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:36:41] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:36:41] [INFO ] Deduced a trap composed of 71 places in 237 ms of which 2 ms to minimize.
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 99 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 87 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 98 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 112 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/780 variables, and 62 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 16:36:53] [INFO ] Deduced a trap composed of 63 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:36:55] [INFO ] Deduced a trap composed of 59 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:36:55] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:36:56] [INFO ] Deduced a trap composed of 68 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:36:56] [INFO ] Deduced a trap composed of 77 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:36:56] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 2 ms to minimize.
[2024-06-01 16:36:57] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:36:57] [INFO ] Deduced a trap composed of 97 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:36:57] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 2 ms to minimize.
[2024-06-01 16:36:57] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:36:57] [INFO ] Deduced a trap composed of 90 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:36:58] [INFO ] Deduced a trap composed of 77 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:36:58] [INFO ] Deduced a trap composed of 72 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:36:58] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:36:59] [INFO ] Deduced a trap composed of 106 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:36:59] [INFO ] Deduced a trap composed of 62 places in 385 ms of which 12 ms to minimize.
[2024-06-01 16:37:00] [INFO ] Deduced a trap composed of 69 places in 364 ms of which 4 ms to minimize.
[2024-06-01 16:37:00] [INFO ] Deduced a trap composed of 104 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:37:00] [INFO ] Deduced a trap composed of 77 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:37:01] [INFO ] Deduced a trap composed of 86 places in 342 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/780 variables, and 82 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 60/60 constraints]
After SMT, in 60587ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62330 ms. Remains : 252/252 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 16 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-06-01 16:37:20] [INFO ] Computed 22 invariants in 10 ms
[2024-06-01 16:37:20] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-06-01 16:37:20] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 15 ms returned sat
[2024-06-01 16:37:20] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:37:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2024-06-01 16:37:21] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 21 ms returned sat
[2024-06-01 16:37:21] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:37:21] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:37:21] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 928 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 326 ms.
Product exploration explored 100000 steps with 0 reset in 379 ms.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-06-01 16:37:22] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:37:23] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 16:37:23] [INFO ] Invariant cache hit.
[2024-06-01 16:37:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:37:24] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2024-06-01 16:37:24] [INFO ] Redundant transitions in 5 ms returned []
Running 520 sub problems to find dead transitions.
[2024-06-01 16:37:24] [INFO ] Invariant cache hit.
[2024-06-01 16:37:24] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 16:37:32] [INFO ] Deduced a trap composed of 94 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:37:33] [INFO ] Deduced a trap composed of 49 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:37:33] [INFO ] Deduced a trap composed of 85 places in 325 ms of which 3 ms to minimize.
[2024-06-01 16:37:33] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:37:34] [INFO ] Deduced a trap composed of 69 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:37:34] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:37:35] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:37:35] [INFO ] Deduced a trap composed of 61 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:37:35] [INFO ] Deduced a trap composed of 112 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:37:36] [INFO ] Deduced a trap composed of 92 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:37:36] [INFO ] Deduced a trap composed of 81 places in 365 ms of which 4 ms to minimize.
[2024-06-01 16:37:36] [INFO ] Deduced a trap composed of 83 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:37:37] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:37:37] [INFO ] Deduced a trap composed of 89 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:37:37] [INFO ] Deduced a trap composed of 89 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:37:38] [INFO ] Deduced a trap composed of 109 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:37:38] [INFO ] Deduced a trap composed of 90 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:37:39] [INFO ] Deduced a trap composed of 76 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:37:39] [INFO ] Deduced a trap composed of 99 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:37:39] [INFO ] Deduced a trap composed of 71 places in 351 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-01 16:37:41] [INFO ] Deduced a trap composed of 83 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:37:42] [INFO ] Deduced a trap composed of 78 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:37:42] [INFO ] Deduced a trap composed of 82 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:37:43] [INFO ] Deduced a trap composed of 110 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:37:43] [INFO ] Deduced a trap composed of 106 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:37:43] [INFO ] Deduced a trap composed of 68 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:37:46] [INFO ] Deduced a trap composed of 105 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:37:46] [INFO ] Deduced a trap composed of 83 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:37:47] [INFO ] Deduced a trap composed of 99 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:37:47] [INFO ] Deduced a trap composed of 73 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:37:48] [INFO ] Deduced a trap composed of 77 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:37:48] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 4 ms to minimize.
[2024-06-01 16:37:48] [INFO ] Deduced a trap composed of 81 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 94 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 63 places in 336 ms of which 4 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 98 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 87 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 106 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 89 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 89 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/784 variables, and 62 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 40/40 constraints]
After SMT, in 60671ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62382 ms. Remains : 254/254 places, 530/530 transitions.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 272769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 27 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-06-01 16:38:25] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 16:38:26] [INFO ] Implicit Places using invariants in 997 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 999 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 16 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-06-01 16:38:26] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:38:26] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 16:38:26] [INFO ] Invariant cache hit.
[2024-06-01 16:38:27] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:38:28] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3114 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 455 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 3639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 26 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-06-01 16:38:28] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 16:38:29] [INFO ] Implicit Places using invariants in 675 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 676 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 9 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-06-01 16:38:29] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 16:38:29] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-01 16:38:29] [INFO ] Invariant cache hit.
[2024-06-01 16:38:30] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:38:31] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2832 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 403 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 3314 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 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 699
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 699
Applied a total of 50 rules in 30 ms. Remains 442 /467 variables (removed 25) and now considering 699/1120 (removed 421) transitions.
// Phase 1: matrix 699 rows 442 cols
[2024-06-01 16:38:32] [INFO ] Computed 23 invariants in 8 ms
[2024-06-01 16:38:32] [INFO ] Implicit Places using invariants in 875 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 876 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/467 places, 699/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 441 /441 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 915 ms. Remains : 441/467 places, 699/1120 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 4 reset in 182 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 1202 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(p1)&&p0))&&F(G(p2)))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 444 transition count 719
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 444 transition count 719
Applied a total of 46 rules in 29 ms. Remains 444 /467 variables (removed 23) and now considering 719/1120 (removed 401) transitions.
// Phase 1: matrix 719 rows 444 cols
[2024-06-01 16:38:33] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 16:38:34] [INFO ] Implicit Places using invariants in 843 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 844 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/467 places, 719/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 443 /443 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 881 ms. Remains : 443/467 places, 719/1120 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 253 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-12 finished in 1423 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((p0||F(G(p1)))))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 17 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-06-01 16:38:34] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 16:38:35] [INFO ] Implicit Places using invariants in 919 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 920 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 12 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 949 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 226 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-13 finished in 1510 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(G(p0))&&F(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 28 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-06-01 16:38:36] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 16:38:36] [INFO ] Implicit Places using invariants in 736 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 739 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 18 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-06-01 16:38:36] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:38:37] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 16:38:37] [INFO ] Invariant cache hit.
[2024-06-01 16:38:38] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:38:39] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3014 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-15 finished in 3415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(X(F(p0)))) U G(!p1)))'
Found a Shortening insensitive property : Anderson-PT-10-LTLFireability-02
Stuttering acceptance computed with spot in 300 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 467 transition count 1031
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 378 transition count 1031
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 203 place count 353 transition count 592
Iterating global reduction 0 with 25 rules applied. Total rules applied 228 place count 353 transition count 592
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 230 place count 352 transition count 591
Applied a total of 230 rules in 54 ms. Remains 352 /467 variables (removed 115) and now considering 591/1120 (removed 529) transitions.
// Phase 1: matrix 591 rows 352 cols
[2024-06-01 16:38:40] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 16:38:40] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-06-01 16:38:40] [INFO ] Invariant cache hit.
[2024-06-01 16:38:41] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:38:43] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 3066 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-06-01 16:38:43] [INFO ] Invariant cache hit.
[2024-06-01 16:38:43] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 1/352 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-01 16:39:09] [INFO ] Deduced a trap composed of 110 places in 480 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/943 variables, and 24 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 1/352 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-01 16:39:26] [INFO ] Deduced a trap composed of 143 places in 412 ms of which 4 ms to minimize.
[2024-06-01 16:39:26] [INFO ] Deduced a trap composed of 162 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:39:26] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 98 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 105 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 89 places in 442 ms of which 6 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 186 places in 496 ms of which 6 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 63 places in 470 ms of which 6 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 88 places in 471 ms of which 5 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 131 places in 498 ms of which 6 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 60 places in 467 ms of which 6 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 165 places in 483 ms of which 6 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 117 places in 430 ms of which 6 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 206 places in 457 ms of which 6 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 225 places in 435 ms of which 6 ms to minimize.
[2024-06-01 16:39:33] [INFO ] Deduced a trap composed of 210 places in 496 ms of which 6 ms to minimize.
[2024-06-01 16:39:33] [INFO ] Deduced a trap composed of 207 places in 473 ms of which 6 ms to minimize.
[2024-06-01 16:39:34] [INFO ] Deduced a trap composed of 207 places in 463 ms of which 6 ms to minimize.
[2024-06-01 16:39:34] [INFO ] Deduced a trap composed of 217 places in 445 ms of which 5 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 176 places in 475 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-01 16:39:39] [INFO ] Deduced a trap composed of 112 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:39:40] [INFO ] Deduced a trap composed of 223 places in 464 ms of which 6 ms to minimize.
[2024-06-01 16:39:41] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:39:42] [INFO ] Deduced a trap composed of 127 places in 470 ms of which 6 ms to minimize.
[2024-06-01 16:39:43] [INFO ] Deduced a trap composed of 119 places in 454 ms of which 6 ms to minimize.
[2024-06-01 16:39:43] [INFO ] Deduced a trap composed of 181 places in 485 ms of which 6 ms to minimize.
[2024-06-01 16:39:44] [INFO ] Deduced a trap composed of 179 places in 459 ms of which 5 ms to minimize.
SMT process timed out in 61022ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 61028ms
Starting structural reductions in LI_LTL mode, iteration 1 : 352/467 places, 591/1120 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64151 ms. Remains : 352/467 places, 591/1120 transitions.
Running random walk in product with property : Anderson-PT-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 32767 steps with 0 reset in 132 ms.
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 64782 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)||(!p0&&F(G(!p1)))))'
[2024-06-01 16:39:44] [INFO ] Flatten gal took : 121 ms
[2024-06-01 16:39:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 16:39:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 467 places, 1120 transitions and 4294 arcs took 22 ms.
Total runtime 726559 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Anderson-PT-10-LTLFireability-08
BK_STOP 1717260151071
--------------------
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
mcc2024
ltl formula name Anderson-PT-10-LTLFireability-02
ltl formula formula --ltl=/tmp/2784/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 467 places, 1120 transitions and 4294 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.060 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2784/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2784/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2784/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2784/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 468 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 468, there are 1264 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2138 levels ~10000 states ~131636 transitions
pnml2lts-mc( 1/ 4): ~4203 levels ~20000 states ~271512 transitions
pnml2lts-mc( 1/ 4): ~8745 levels ~40000 states ~489852 transitions
pnml2lts-mc( 1/ 4): ~17851 levels ~80000 states ~796492 transitions
pnml2lts-mc( 1/ 4): ~34356 levels ~160000 states ~1474140 transitions
pnml2lts-mc( 1/ 4): ~67208 levels ~320000 states ~2806276 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~97551!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 438255
pnml2lts-mc( 0/ 4): unique transitions count: 4243927
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1536364
pnml2lts-mc( 0/ 4): - claim success count: 438258
pnml2lts-mc( 0/ 4): - cum. max stack depth: 388350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 438258 states 4244111 transitions, fanout: 9.684
pnml2lts-mc( 0/ 4): Total exploration time 13.740 sec (13.740 sec minimum, 13.740 sec on average)
pnml2lts-mc( 0/ 4): States per second: 31897, Transitions per second: 308887
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 11.9MB, 16.0 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 1150 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 11.9MB (~256.0MB paged-in)
ltl formula name Anderson-PT-10-LTLFireability-08
ltl formula formula --ltl=/tmp/2784/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 467 places, 1120 transitions and 4294 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.050 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2784/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2784/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2784/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2784/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 468 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 468, there are 1149 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2206 levels ~10000 states ~48068 transitions
pnml2lts-mc( 0/ 4): ~4384 levels ~20000 states ~104116 transitions
pnml2lts-mc( 0/ 4): ~8679 levels ~40000 states ~204140 transitions
pnml2lts-mc( 0/ 4): ~17560 levels ~80000 states ~407428 transitions
pnml2lts-mc( 0/ 4): ~34690 levels ~160000 states ~827068 transitions
pnml2lts-mc( 0/ 4): ~68384 levels ~320000 states ~1727216 transitions
pnml2lts-mc( 0/ 4): ~136108 levels ~640000 states ~3437380 transitions
pnml2lts-mc( 0/ 4): ~272832 levels ~1280000 states ~6905036 transitions
pnml2lts-mc( 0/ 4): ~544036 levels ~2560000 states ~13861520 transitions
pnml2lts-mc( 0/ 4): ~1078676 levels ~5120000 states ~28042276 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5477623
pnml2lts-mc( 0/ 4): unique transitions count: 31487726
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 12469627
pnml2lts-mc( 0/ 4): - claim success count: 5477632
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4777148
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5477641 states 31487878 transitions, fanout: 5.748
pnml2lts-mc( 0/ 4): Total exploration time 150.700 sec (150.680 sec minimum, 150.688 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36348, Transitions per second: 208944
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 134.2MB, 15.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1150 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 134.2MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-10, 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 r464-smll-171620118400364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;