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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 264K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 12 03:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 831K Apr 12 03:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 517K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 617K Apr 12 04:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 12 04:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717279108662

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:58:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:58:32] [INFO ] Load time of PNML (sax parser for PT used): 596 ms
[2024-06-01 21:58:32] [INFO ] Transformed 1992 places.
[2024-06-01 21:58:32] [INFO ] Transformed 3096 transitions.
[2024-06-01 21:58:32] [INFO ] Found NUPN structural information;
[2024-06-01 21:58:32] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 882 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 103 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-7-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1530 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 154 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 21:58:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 21:58:33] [INFO ] Computed 31 invariants in 77 ms
[2024-06-01 21:58:34] [INFO ] Implicit Places using invariants in 1340 ms returned [1976, 1977, 1978, 1980, 1989, 1990, 1991]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1445 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 71 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1706 ms. Remains : 1985/1992 places, 3096/3096 transitions.
Support contains 1530 out of 1985 places after structural reductions.
[2024-06-01 21:58:35] [INFO ] Flatten gal took : 408 ms
[2024-06-01 21:58:36] [INFO ] Flatten gal took : 213 ms
[2024-06-01 21:58:36] [INFO ] Input system was already deterministic with 3096 transitions.
Reduction of identical properties reduced properties to check from 30 to 26
RANDOM walk for 40000 steps (8 resets) in 5384 ms. (7 steps per ms) remains 10/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2416 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
[2024-06-01 21:58:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1985 cols
[2024-06-01 21:58:40] [INFO ] Computed 24 invariants in 37 ms
[2024-06-01 21:58:40] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1803/1976 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1976 variables, 1803/1991 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 21:58:46] [INFO ] Deduced a trap composed of 30 places in 3227 ms of which 177 ms to minimize.
[2024-06-01 21:58:48] [INFO ] Deduced a trap composed of 100 places in 2051 ms of which 18 ms to minimize.
SMT process timed out in 8289ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 173 out of 1985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 874 transitions
Trivial Post-agglo rules discarded 874 transitions
Performed 874 trivial Post agglomeration. Transition count delta: 874
Iterating post reduction 0 with 874 rules applied. Total rules applied 874 place count 1985 transition count 2222
Reduce places removed 874 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 879 rules applied. Total rules applied 1753 place count 1111 transition count 2217
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1758 place count 1106 transition count 2217
Performed 403 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 403 Pre rules applied. Total rules applied 1758 place count 1106 transition count 1814
Deduced a syphon composed of 403 places in 5 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 3 with 806 rules applied. Total rules applied 2564 place count 703 transition count 1814
Applied a total of 2564 rules in 884 ms. Remains 703 /1985 variables (removed 1282) and now considering 1814/3096 (removed 1282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 703/1985 places, 1814/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1092 ms. (36 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2649 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
[2024-06-01 21:58:50] [INFO ] Flow matrix only has 1478 transitions (discarded 336 similar events)
// Phase 1: matrix 1478 rows 703 cols
[2024-06-01 21:58:50] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 21:58:50] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 523/694 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 523/709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:58:52] [INFO ] Deduced a trap composed of 36 places in 796 ms of which 8 ms to minimize.
[2024-06-01 21:58:53] [INFO ] Deduced a trap composed of 26 places in 743 ms of which 8 ms to minimize.
[2024-06-01 21:58:54] [INFO ] Deduced a trap composed of 33 places in 641 ms of which 8 ms to minimize.
[2024-06-01 21:58:54] [INFO ] Deduced a trap composed of 25 places in 811 ms of which 10 ms to minimize.
[2024-06-01 21:58:55] [INFO ] Deduced a trap composed of 14 places in 797 ms of which 10 ms to minimize.
[2024-06-01 21:58:56] [INFO ] Deduced a trap composed of 55 places in 900 ms of which 12 ms to minimize.
[2024-06-01 21:58:57] [INFO ] Deduced a trap composed of 11 places in 746 ms of which 9 ms to minimize.
[2024-06-01 21:58:58] [INFO ] Deduced a trap composed of 66 places in 700 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 8/717 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:58:59] [INFO ] Deduced a trap composed of 14 places in 1075 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 8/702 variables, 8/726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 8/734 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:01] [INFO ] Deduced a trap composed of 11 places in 743 ms of which 9 ms to minimize.
[2024-06-01 21:59:01] [INFO ] Deduced a trap composed of 15 places in 823 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:03] [INFO ] Deduced a trap composed of 11 places in 846 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/703 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/703 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/703 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1478/2181 variables, 703/1442 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2181 variables, 497/1939 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2181 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/2181 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2181/2181 variables, and 1939 constraints, problems are : Problem set: 0 solved, 8 unsolved in 15101 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 523/694 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 523/709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 12/721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:08] [INFO ] Deduced a trap composed of 16 places in 904 ms of which 15 ms to minimize.
[2024-06-01 21:59:08] [INFO ] Deduced a trap composed of 15 places in 928 ms of which 12 ms to minimize.
[2024-06-01 21:59:09] [INFO ] Deduced a trap composed of 14 places in 601 ms of which 6 ms to minimize.
[2024-06-01 21:59:10] [INFO ] Deduced a trap composed of 14 places in 657 ms of which 6 ms to minimize.
[2024-06-01 21:59:10] [INFO ] Deduced a trap composed of 17 places in 573 ms of which 7 ms to minimize.
[2024-06-01 21:59:11] [INFO ] Deduced a trap composed of 22 places in 580 ms of which 7 ms to minimize.
[2024-06-01 21:59:12] [INFO ] Deduced a trap composed of 22 places in 723 ms of which 9 ms to minimize.
[2024-06-01 21:59:12] [INFO ] Deduced a trap composed of 22 places in 577 ms of which 6 ms to minimize.
[2024-06-01 21:59:13] [INFO ] Deduced a trap composed of 17 places in 821 ms of which 10 ms to minimize.
[2024-06-01 21:59:14] [INFO ] Deduced a trap composed of 33 places in 942 ms of which 8 ms to minimize.
[2024-06-01 21:59:15] [INFO ] Deduced a trap composed of 28 places in 771 ms of which 7 ms to minimize.
[2024-06-01 21:59:16] [INFO ] Deduced a trap composed of 39 places in 802 ms of which 9 ms to minimize.
[2024-06-01 21:59:17] [INFO ] Deduced a trap composed of 40 places in 822 ms of which 9 ms to minimize.
[2024-06-01 21:59:18] [INFO ] Deduced a trap composed of 37 places in 806 ms of which 9 ms to minimize.
[2024-06-01 21:59:18] [INFO ] Deduced a trap composed of 121 places in 774 ms of which 9 ms to minimize.
[2024-06-01 21:59:19] [INFO ] Deduced a trap composed of 29 places in 843 ms of which 9 ms to minimize.
[2024-06-01 21:59:20] [INFO ] Deduced a trap composed of 65 places in 796 ms of which 10 ms to minimize.
[2024-06-01 21:59:21] [INFO ] Deduced a trap composed of 30 places in 937 ms of which 10 ms to minimize.
[2024-06-01 21:59:22] [INFO ] Deduced a trap composed of 63 places in 858 ms of which 10 ms to minimize.
[2024-06-01 21:59:23] [INFO ] Deduced a trap composed of 77 places in 649 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 20/741 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:23] [INFO ] Deduced a trap composed of 61 places in 647 ms of which 10 ms to minimize.
[2024-06-01 21:59:24] [INFO ] Deduced a trap composed of 54 places in 804 ms of which 9 ms to minimize.
[2024-06-01 21:59:25] [INFO ] Deduced a trap composed of 51 places in 839 ms of which 9 ms to minimize.
[2024-06-01 21:59:26] [INFO ] Deduced a trap composed of 50 places in 767 ms of which 9 ms to minimize.
[2024-06-01 21:59:27] [INFO ] Deduced a trap composed of 84 places in 730 ms of which 9 ms to minimize.
[2024-06-01 21:59:27] [INFO ] Deduced a trap composed of 93 places in 699 ms of which 8 ms to minimize.
[2024-06-01 21:59:28] [INFO ] Deduced a trap composed of 83 places in 668 ms of which 8 ms to minimize.
[2024-06-01 21:59:29] [INFO ] Deduced a trap composed of 61 places in 647 ms of which 6 ms to minimize.
[2024-06-01 21:59:30] [INFO ] Deduced a trap composed of 93 places in 759 ms of which 9 ms to minimize.
[2024-06-01 21:59:30] [INFO ] Deduced a trap composed of 54 places in 514 ms of which 6 ms to minimize.
[2024-06-01 21:59:31] [INFO ] Deduced a trap composed of 86 places in 474 ms of which 6 ms to minimize.
[2024-06-01 21:59:31] [INFO ] Deduced a trap composed of 90 places in 423 ms of which 5 ms to minimize.
[2024-06-01 21:59:32] [INFO ] Deduced a trap composed of 72 places in 678 ms of which 5 ms to minimize.
[2024-06-01 21:59:32] [INFO ] Deduced a trap composed of 48 places in 595 ms of which 8 ms to minimize.
[2024-06-01 21:59:33] [INFO ] Deduced a trap composed of 107 places in 561 ms of which 7 ms to minimize.
[2024-06-01 21:59:34] [INFO ] Deduced a trap composed of 63 places in 675 ms of which 8 ms to minimize.
[2024-06-01 21:59:34] [INFO ] Deduced a trap composed of 73 places in 356 ms of which 6 ms to minimize.
[2024-06-01 21:59:34] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 5 ms to minimize.
[2024-06-01 21:59:35] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 3 ms to minimize.
[2024-06-01 21:59:35] [INFO ] Deduced a trap composed of 46 places in 439 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 20/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:36] [INFO ] Deduced a trap composed of 48 places in 610 ms of which 8 ms to minimize.
[2024-06-01 21:59:37] [INFO ] Deduced a trap composed of 58 places in 692 ms of which 8 ms to minimize.
[2024-06-01 21:59:37] [INFO ] Deduced a trap composed of 50 places in 526 ms of which 10 ms to minimize.
[2024-06-01 21:59:38] [INFO ] Deduced a trap composed of 48 places in 633 ms of which 8 ms to minimize.
[2024-06-01 21:59:39] [INFO ] Deduced a trap composed of 48 places in 635 ms of which 8 ms to minimize.
[2024-06-01 21:59:39] [INFO ] Deduced a trap composed of 83 places in 414 ms of which 6 ms to minimize.
[2024-06-01 21:59:40] [INFO ] Deduced a trap composed of 83 places in 411 ms of which 5 ms to minimize.
[2024-06-01 21:59:40] [INFO ] Deduced a trap composed of 83 places in 418 ms of which 6 ms to minimize.
[2024-06-01 21:59:41] [INFO ] Deduced a trap composed of 83 places in 426 ms of which 6 ms to minimize.
[2024-06-01 21:59:41] [INFO ] Deduced a trap composed of 46 places in 732 ms of which 9 ms to minimize.
[2024-06-01 21:59:42] [INFO ] Deduced a trap composed of 83 places in 382 ms of which 6 ms to minimize.
[2024-06-01 21:59:43] [INFO ] Deduced a trap composed of 25 places in 751 ms of which 9 ms to minimize.
[2024-06-01 21:59:44] [INFO ] Deduced a trap composed of 27 places in 761 ms of which 9 ms to minimize.
[2024-06-01 21:59:44] [INFO ] Deduced a trap composed of 24 places in 691 ms of which 8 ms to minimize.
[2024-06-01 21:59:45] [INFO ] Deduced a trap composed of 79 places in 574 ms of which 7 ms to minimize.
[2024-06-01 21:59:46] [INFO ] Deduced a trap composed of 68 places in 605 ms of which 7 ms to minimize.
[2024-06-01 21:59:47] [INFO ] Deduced a trap composed of 48 places in 747 ms of which 9 ms to minimize.
[2024-06-01 21:59:47] [INFO ] Deduced a trap composed of 58 places in 782 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 18/779 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/694 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 8/702 variables, 8/787 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 8/795 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:50] [INFO ] Deduced a trap composed of 23 places in 826 ms of which 9 ms to minimize.
[2024-06-01 21:59:51] [INFO ] Deduced a trap composed of 33 places in 734 ms of which 9 ms to minimize.
SMT process timed out in 60802ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 171 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1814/1814 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 703 transition count 1813
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 702 transition count 1813
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 702 transition count 1811
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 700 transition count 1811
Applied a total of 6 rules in 122 ms. Remains 700 /703 variables (removed 3) and now considering 1811/1814 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 700/703 places, 1811/1814 transitions.
RANDOM walk for 40000 steps (8 resets) in 1004 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1996 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 128511 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 8
Probabilistic random walk after 128511 steps, saw 39200 distinct states, run finished after 3010 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 21:59:55] [INFO ] Flow matrix only has 1475 transitions (discarded 336 similar events)
// Phase 1: matrix 1475 rows 700 cols
[2024-06-01 21:59:55] [INFO ] Computed 24 invariants in 9 ms
[2024-06-01 21:59:55] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 520/691 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 520/706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:59:58] [INFO ] Deduced a trap composed of 24 places in 838 ms of which 9 ms to minimize.
[2024-06-01 21:59:58] [INFO ] Deduced a trap composed of 11 places in 808 ms of which 9 ms to minimize.
[2024-06-01 21:59:59] [INFO ] Deduced a trap composed of 25 places in 884 ms of which 9 ms to minimize.
[2024-06-01 22:00:00] [INFO ] Deduced a trap composed of 173 places in 845 ms of which 9 ms to minimize.
[2024-06-01 22:00:01] [INFO ] Deduced a trap composed of 74 places in 891 ms of which 9 ms to minimize.
[2024-06-01 22:00:02] [INFO ] Deduced a trap composed of 13 places in 853 ms of which 9 ms to minimize.
[2024-06-01 22:00:03] [INFO ] Deduced a trap composed of 29 places in 535 ms of which 6 ms to minimize.
[2024-06-01 22:00:03] [INFO ] Deduced a trap composed of 15 places in 656 ms of which 9 ms to minimize.
[2024-06-01 22:00:04] [INFO ] Deduced a trap composed of 29 places in 803 ms of which 10 ms to minimize.
[2024-06-01 22:00:05] [INFO ] Deduced a trap composed of 24 places in 817 ms of which 12 ms to minimize.
[2024-06-01 22:00:06] [INFO ] Deduced a trap composed of 16 places in 821 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 11/717 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:00:07] [INFO ] Deduced a trap composed of 23 places in 829 ms of which 9 ms to minimize.
[2024-06-01 22:00:08] [INFO ] Deduced a trap composed of 11 places in 792 ms of which 6 ms to minimize.
[2024-06-01 22:00:08] [INFO ] Deduced a trap composed of 33 places in 581 ms of which 10 ms to minimize.
[2024-06-01 22:00:09] [INFO ] Deduced a trap composed of 22 places in 765 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 4/721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:00:10] [INFO ] Deduced a trap composed of 33 places in 726 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 8/699 variables, 8/730 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 8/738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/700 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1475/2175 variables, 700/1440 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2175 variables, 497/1937 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2175 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/2175 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2175/2175 variables, and 1937 constraints, problems are : Problem set: 0 solved, 8 unsolved in 17934 ms.
Refiners :[Domain max(s): 700/700 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 700/700 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 520/691 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 520/706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 16/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:00:15] [INFO ] Deduced a trap composed of 30 places in 778 ms of which 9 ms to minimize.
[2024-06-01 22:00:16] [INFO ] Deduced a trap composed of 16 places in 651 ms of which 8 ms to minimize.
[2024-06-01 22:00:17] [INFO ] Deduced a trap composed of 58 places in 553 ms of which 6 ms to minimize.
[2024-06-01 22:00:17] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 6 ms to minimize.
[2024-06-01 22:00:18] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 5 ms to minimize.
[2024-06-01 22:00:18] [INFO ] Deduced a trap composed of 26 places in 497 ms of which 6 ms to minimize.
[2024-06-01 22:00:19] [INFO ] Deduced a trap composed of 61 places in 435 ms of which 5 ms to minimize.
[2024-06-01 22:00:19] [INFO ] Deduced a trap composed of 25 places in 467 ms of which 6 ms to minimize.
[2024-06-01 22:00:20] [INFO ] Deduced a trap composed of 37 places in 601 ms of which 8 ms to minimize.
[2024-06-01 22:00:20] [INFO ] Deduced a trap composed of 38 places in 417 ms of which 6 ms to minimize.
[2024-06-01 22:00:21] [INFO ] Deduced a trap composed of 73 places in 527 ms of which 6 ms to minimize.
[2024-06-01 22:00:21] [INFO ] Deduced a trap composed of 81 places in 673 ms of which 8 ms to minimize.
[2024-06-01 22:00:22] [INFO ] Deduced a trap composed of 49 places in 650 ms of which 10 ms to minimize.
[2024-06-01 22:00:23] [INFO ] Deduced a trap composed of 48 places in 633 ms of which 9 ms to minimize.
[2024-06-01 22:00:23] [INFO ] Deduced a trap composed of 72 places in 594 ms of which 8 ms to minimize.
[2024-06-01 22:00:24] [INFO ] Deduced a trap composed of 72 places in 633 ms of which 8 ms to minimize.
[2024-06-01 22:00:25] [INFO ] Deduced a trap composed of 11 places in 816 ms of which 9 ms to minimize.
[2024-06-01 22:00:26] [INFO ] Deduced a trap composed of 59 places in 736 ms of which 9 ms to minimize.
[2024-06-01 22:00:26] [INFO ] Deduced a trap composed of 15 places in 706 ms of which 6 ms to minimize.
[2024-06-01 22:00:27] [INFO ] Deduced a trap composed of 44 places in 575 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 20/742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:00:28] [INFO ] Deduced a trap composed of 119 places in 695 ms of which 6 ms to minimize.
[2024-06-01 22:00:28] [INFO ] Deduced a trap composed of 62 places in 526 ms of which 5 ms to minimize.
[2024-06-01 22:00:29] [INFO ] Deduced a trap composed of 41 places in 538 ms of which 7 ms to minimize.
[2024-06-01 22:00:30] [INFO ] Deduced a trap composed of 81 places in 546 ms of which 7 ms to minimize.
[2024-06-01 22:00:30] [INFO ] Deduced a trap composed of 83 places in 650 ms of which 7 ms to minimize.
[2024-06-01 22:00:31] [INFO ] Deduced a trap composed of 50 places in 546 ms of which 7 ms to minimize.
[2024-06-01 22:00:32] [INFO ] Deduced a trap composed of 37 places in 706 ms of which 8 ms to minimize.
[2024-06-01 22:00:32] [INFO ] Deduced a trap composed of 28 places in 649 ms of which 7 ms to minimize.
[2024-06-01 22:00:33] [INFO ] Deduced a trap composed of 50 places in 475 ms of which 6 ms to minimize.
[2024-06-01 22:00:34] [INFO ] Deduced a trap composed of 61 places in 665 ms of which 8 ms to minimize.
[2024-06-01 22:00:34] [INFO ] Deduced a trap composed of 48 places in 597 ms of which 8 ms to minimize.
[2024-06-01 22:00:35] [INFO ] Deduced a trap composed of 47 places in 602 ms of which 7 ms to minimize.
[2024-06-01 22:00:35] [INFO ] Deduced a trap composed of 35 places in 499 ms of which 7 ms to minimize.
[2024-06-01 22:00:36] [INFO ] Deduced a trap composed of 48 places in 522 ms of which 5 ms to minimize.
[2024-06-01 22:00:36] [INFO ] Deduced a trap composed of 50 places in 552 ms of which 8 ms to minimize.
[2024-06-01 22:00:37] [INFO ] Deduced a trap composed of 47 places in 881 ms of which 7 ms to minimize.
[2024-06-01 22:00:38] [INFO ] Deduced a trap composed of 53 places in 634 ms of which 6 ms to minimize.
[2024-06-01 22:00:39] [INFO ] Deduced a trap composed of 47 places in 612 ms of which 6 ms to minimize.
[2024-06-01 22:00:39] [INFO ] Deduced a trap composed of 65 places in 547 ms of which 9 ms to minimize.
[2024-06-01 22:00:40] [INFO ] Deduced a trap composed of 33 places in 789 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 20/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:00:41] [INFO ] Deduced a trap composed of 50 places in 664 ms of which 8 ms to minimize.
[2024-06-01 22:00:42] [INFO ] Deduced a trap composed of 47 places in 728 ms of which 9 ms to minimize.
[2024-06-01 22:00:43] [INFO ] Deduced a trap composed of 72 places in 651 ms of which 7 ms to minimize.
[2024-06-01 22:00:43] [INFO ] Deduced a trap composed of 72 places in 629 ms of which 7 ms to minimize.
[2024-06-01 22:00:44] [INFO ] Deduced a trap composed of 39 places in 574 ms of which 7 ms to minimize.
[2024-06-01 22:00:44] [INFO ] Deduced a trap composed of 83 places in 520 ms of which 7 ms to minimize.
[2024-06-01 22:00:45] [INFO ] Deduced a trap composed of 61 places in 412 ms of which 6 ms to minimize.
[2024-06-01 22:00:46] [INFO ] Deduced a trap composed of 45 places in 625 ms of which 7 ms to minimize.
[2024-06-01 22:00:46] [INFO ] Deduced a trap composed of 72 places in 344 ms of which 5 ms to minimize.
[2024-06-01 22:00:47] [INFO ] Deduced a trap composed of 22 places in 655 ms of which 8 ms to minimize.
[2024-06-01 22:00:48] [INFO ] Deduced a trap composed of 53 places in 793 ms of which 9 ms to minimize.
[2024-06-01 22:00:48] [INFO ] Deduced a trap composed of 123 places in 373 ms of which 5 ms to minimize.
[2024-06-01 22:00:49] [INFO ] Deduced a trap composed of 31 places in 805 ms of which 10 ms to minimize.
[2024-06-01 22:00:50] [INFO ] Deduced a trap composed of 27 places in 794 ms of which 10 ms to minimize.
[2024-06-01 22:00:51] [INFO ] Deduced a trap composed of 30 places in 769 ms of which 9 ms to minimize.
[2024-06-01 22:00:51] [INFO ] Deduced a trap composed of 50 places in 681 ms of which 8 ms to minimize.
[2024-06-01 22:00:52] [INFO ] Deduced a trap composed of 50 places in 709 ms of which 8 ms to minimize.
[2024-06-01 22:00:53] [INFO ] Deduced a trap composed of 61 places in 770 ms of which 9 ms to minimize.
[2024-06-01 22:00:54] [INFO ] Deduced a trap composed of 47 places in 774 ms of which 8 ms to minimize.
[2024-06-01 22:00:54] [INFO ] Deduced a trap composed of 58 places in 550 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 20/782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:00:55] [INFO ] Deduced a trap composed of 59 places in 548 ms of which 7 ms to minimize.
[2024-06-01 22:00:56] [INFO ] Deduced a trap composed of 58 places in 620 ms of which 7 ms to minimize.
[2024-06-01 22:00:57] [INFO ] Deduced a trap composed of 80 places in 673 ms of which 8 ms to minimize.
[2024-06-01 22:00:58] [INFO ] Deduced a trap composed of 14 places in 757 ms of which 9 ms to minimize.
[2024-06-01 22:00:59] [INFO ] Deduced a trap composed of 13 places in 743 ms of which 9 ms to minimize.
[2024-06-01 22:00:59] [INFO ] Deduced a trap composed of 13 places in 730 ms of which 9 ms to minimize.
[2024-06-01 22:01:00] [INFO ] Deduced a trap composed of 91 places in 773 ms of which 9 ms to minimize.
[2024-06-01 22:01:01] [INFO ] Deduced a trap composed of 28 places in 656 ms of which 9 ms to minimize.
[2024-06-01 22:01:02] [INFO ] Deduced a trap composed of 15 places in 695 ms of which 9 ms to minimize.
[2024-06-01 22:01:03] [INFO ] Deduced a trap composed of 48 places in 777 ms of which 9 ms to minimize.
[2024-06-01 22:01:03] [INFO ] Deduced a trap composed of 74 places in 864 ms of which 10 ms to minimize.
[2024-06-01 22:01:04] [INFO ] Deduced a trap composed of 53 places in 674 ms of which 9 ms to minimize.
[2024-06-01 22:01:05] [INFO ] Deduced a trap composed of 48 places in 927 ms of which 10 ms to minimize.
[2024-06-01 22:01:06] [INFO ] Deduced a trap composed of 38 places in 930 ms of which 10 ms to minimize.
[2024-06-01 22:01:07] [INFO ] Deduced a trap composed of 33 places in 578 ms of which 5 ms to minimize.
[2024-06-01 22:01:07] [INFO ] Deduced a trap composed of 25 places in 519 ms of which 7 ms to minimize.
[2024-06-01 22:01:08] [INFO ] Deduced a trap composed of 11 places in 680 ms of which 9 ms to minimize.
[2024-06-01 22:01:09] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 9 ms to minimize.
[2024-06-01 22:01:10] [INFO ] Deduced a trap composed of 24 places in 723 ms of which 9 ms to minimize.
[2024-06-01 22:01:10] [INFO ] Deduced a trap composed of 32 places in 512 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 20/802 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:01:11] [INFO ] Deduced a trap composed of 30 places in 445 ms of which 8 ms to minimize.
[2024-06-01 22:01:12] [INFO ] Deduced a trap composed of 24 places in 412 ms of which 5 ms to minimize.
[2024-06-01 22:01:13] [INFO ] Deduced a trap composed of 50 places in 683 ms of which 8 ms to minimize.
[2024-06-01 22:01:14] [INFO ] Deduced a trap composed of 26 places in 656 ms of which 7 ms to minimize.
[2024-06-01 22:01:14] [INFO ] Deduced a trap composed of 26 places in 480 ms of which 8 ms to minimize.
[2024-06-01 22:01:15] [INFO ] Deduced a trap composed of 48 places in 586 ms of which 5 ms to minimize.
[2024-06-01 22:01:15] [INFO ] Deduced a trap composed of 84 places in 231 ms of which 4 ms to minimize.
[2024-06-01 22:01:15] [INFO ] Deduced a trap composed of 83 places in 345 ms of which 5 ms to minimize.
[2024-06-01 22:01:16] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 4 ms to minimize.
[2024-06-01 22:01:16] [INFO ] Deduced a trap composed of 83 places in 262 ms of which 3 ms to minimize.
[2024-06-01 22:01:17] [INFO ] Deduced a trap composed of 83 places in 431 ms of which 5 ms to minimize.
[2024-06-01 22:01:18] [INFO ] Deduced a trap composed of 81 places in 686 ms of which 8 ms to minimize.
[2024-06-01 22:01:19] [INFO ] Deduced a trap composed of 47 places in 635 ms of which 7 ms to minimize.
[2024-06-01 22:01:20] [INFO ] Deduced a trap composed of 36 places in 654 ms of which 8 ms to minimize.
[2024-06-01 22:01:21] [INFO ] Deduced a trap composed of 36 places in 723 ms of which 8 ms to minimize.
[2024-06-01 22:01:21] [INFO ] Deduced a trap composed of 37 places in 631 ms of which 8 ms to minimize.
[2024-06-01 22:01:22] [INFO ] Deduced a trap composed of 48 places in 681 ms of which 8 ms to minimize.
[2024-06-01 22:01:23] [INFO ] Deduced a trap composed of 133 places in 665 ms of which 8 ms to minimize.
[2024-06-01 22:01:23] [INFO ] Deduced a trap composed of 37 places in 648 ms of which 8 ms to minimize.
[2024-06-01 22:01:24] [INFO ] Deduced a trap composed of 37 places in 672 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 20/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 22:01:25] [INFO ] Deduced a trap composed of 36 places in 602 ms of which 7 ms to minimize.
[2024-06-01 22:01:27] [INFO ] Deduced a trap composed of 15 places in 795 ms of which 8 ms to minimize.
[2024-06-01 22:01:27] [INFO ] Deduced a trap composed of 34 places in 651 ms of which 8 ms to minimize.
[2024-06-01 22:01:28] [INFO ] Deduced a trap composed of 69 places in 640 ms of which 8 ms to minimize.
[2024-06-01 22:01:29] [INFO ] Deduced a trap composed of 99 places in 526 ms of which 7 ms to minimize.
[2024-06-01 22:01:29] [INFO ] Deduced a trap composed of 11 places in 838 ms of which 10 ms to minimize.
SMT process timed out in 94089ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 171 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1811/1811 transitions.
Applied a total of 0 rules in 67 ms. Remains 700 /700 variables (removed 0) and now considering 1811/1811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 700/700 places, 1811/1811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1811/1811 transitions.
Applied a total of 0 rules in 62 ms. Remains 700 /700 variables (removed 0) and now considering 1811/1811 (removed 0) transitions.
[2024-06-01 22:01:30] [INFO ] Flow matrix only has 1475 transitions (discarded 336 similar events)
[2024-06-01 22:01:30] [INFO ] Invariant cache hit.
[2024-06-01 22:01:31] [INFO ] Implicit Places using invariants in 1079 ms returned [691]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1083 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 699/700 places, 1811/1811 transitions.
Applied a total of 0 rules in 58 ms. Remains 699 /699 variables (removed 0) and now considering 1811/1811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1205 ms. Remains : 699/700 places, 1811/1811 transitions.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(G((p0 U (!p1||G(p2))))))'
Support contains 616 out of 1985 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1985 transition count 2655
Reduce places removed 441 places and 0 transitions.
Iterating post reduction 1 with 441 rules applied. Total rules applied 882 place count 1544 transition count 2655
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 882 place count 1544 transition count 2599
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 994 place count 1488 transition count 2599
Applied a total of 994 rules in 478 ms. Remains 1488 /1985 variables (removed 497) and now considering 2599/3096 (removed 497) transitions.
[2024-06-01 22:01:32] [INFO ] Flow matrix only has 2263 transitions (discarded 336 similar events)
// Phase 1: matrix 2263 rows 1488 cols
[2024-06-01 22:01:32] [INFO ] Computed 24 invariants in 10 ms
[2024-06-01 22:01:33] [INFO ] Implicit Places using invariants in 1511 ms returned [1479]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1518 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1487/1985 places, 2599/3096 transitions.
Applied a total of 0 rules in 89 ms. Remains 1487 /1487 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2087 ms. Remains : 1487/1985 places, 2599/3096 transitions.
Stuttering acceptance computed with spot in 450 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00
Product exploration timeout after 62060 steps with 1612 reset in 10001 ms.
Stack based approach found an accepted trace after 18775 steps with 504 reset with depth 17 and stack size 17 in 2879 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 15562 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((F(G(p1))&&p0)))'
Support contains 112 out of 1985 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1985 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1089 transition count 2200
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1792 place count 1089 transition count 1800
Deduced a syphon composed of 400 places in 0 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 2592 place count 689 transition count 1800
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2704 place count 633 transition count 1744
Applied a total of 2704 rules in 182 ms. Remains 633 /1985 variables (removed 1352) and now considering 1744/3096 (removed 1352) transitions.
[2024-06-01 22:01:47] [INFO ] Flow matrix only has 1408 transitions (discarded 336 similar events)
// Phase 1: matrix 1408 rows 633 cols
[2024-06-01 22:01:47] [INFO ] Computed 24 invariants in 7 ms
[2024-06-01 22:01:48] [INFO ] Implicit Places using invariants in 951 ms returned [624]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 955 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 632/1985 places, 1744/3096 transitions.
Applied a total of 0 rules in 53 ms. Remains 632 /632 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1192 ms. Remains : 632/1985 places, 1744/3096 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 6343 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 7727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X((X(G(p2))||p1))))))'
Support contains 568 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 81 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:01:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1985 cols
[2024-06-01 22:01:55] [INFO ] Computed 24 invariants in 11 ms
[2024-06-01 22:01:56] [INFO ] Implicit Places using invariants in 987 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 991 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 84 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1157 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 1555 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(p1)))'
Support contains 72 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 240 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:01:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:01:56] [INFO ] Invariant cache hit.
[2024-06-01 22:01:58] [INFO ] Implicit Places using invariants in 1828 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1835 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 141 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2220 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 901 ms.
Stack based approach found an accepted trace after 841 steps with 0 reset with depth 842 and stack size 842 in 9 ms.
FORMULA Peterson-PT-7-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-03 finished in 3334 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&&F(p1)))&&X(X(G(p2)))))'
Support contains 168 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 160 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:00] [INFO ] Invariant cache hit.
[2024-06-01 22:02:01] [INFO ] Implicit Places using invariants in 1413 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1416 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 135 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1714 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 2053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(p1) U X(p2)))))'
Support contains 840 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 65 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:02] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:02] [INFO ] Invariant cache hit.
[2024-06-01 22:02:03] [INFO ] Implicit Places using invariants in 1141 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 38 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1248 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06
Product exploration explored 100000 steps with 7393 reset in 2683 ms.
Stack based approach found an accepted trace after 24184 steps with 1814 reset with depth 12 and stack size 12 in 568 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 4738 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((X((F(G(p0)) U p1)) U p2)))'
Support contains 568 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 73 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:06] [INFO ] Invariant cache hit.
[2024-06-01 22:02:07] [INFO ] Implicit Places using invariants in 718 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 720 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 77 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 6823 ms.
Stack based approach found an accepted trace after 725 steps with 0 reset with depth 726 and stack size 725 in 38 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 7991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 4 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 82 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:14] [INFO ] Invariant cache hit.
[2024-06-01 22:02:16] [INFO ] Implicit Places using invariants in 1482 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1485 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 87 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1655 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 1864 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||X((G(F(p1)) U p2)))))'
Support contains 2 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 105 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:16] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:16] [INFO ] Invariant cache hit.
[2024-06-01 22:02:18] [INFO ] Implicit Places using invariants in 2012 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2017 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 124 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2249 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 471 ms.
Product exploration explored 100000 steps with 0 reset in 491 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 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 137835 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 3
Probabilistic random walk after 137835 steps, saw 89278 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-06-01 22:02:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:02:23] [INFO ] Computed 23 invariants in 12 ms
[2024-06-01 22:02:23] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 0/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/3211 variables, 7/2892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3211 variables, 7/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3211 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1533/4744 variables, 1589/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4744/4744 variables, and 4488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3322 ms.
Refiners :[Domain max(s): 1984/1984 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1984/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 3/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:02:30] [INFO ] Deduced a trap composed of 17 places in 2027 ms of which 18 ms to minimize.
[2024-06-01 22:02:32] [INFO ] Deduced a trap composed of 137 places in 1850 ms of which 16 ms to minimize.
SMT process timed out in 9007ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1984 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1089 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1088 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1088 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 641 transition count 1753
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2796 place count 586 transition count 1698
Applied a total of 2796 rules in 214 ms. Remains 586 /1984 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 586/1984 places, 1698/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 440316 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 3
Probabilistic random walk after 440316 steps, saw 63728 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-06-01 22:02:36] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-06-01 22:02:36] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:02:36] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1287 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:02:38] [INFO ] Deduced a trap composed of 59 places in 639 ms of which 6 ms to minimize.
[2024-06-01 22:02:39] [INFO ] Deduced a trap composed of 33 places in 579 ms of which 6 ms to minimize.
[2024-06-01 22:02:40] [INFO ] Deduced a trap composed of 12 places in 663 ms of which 5 ms to minimize.
[2024-06-01 22:02:40] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 8 ms to minimize.
[2024-06-01 22:02:41] [INFO ] Deduced a trap composed of 50 places in 681 ms of which 7 ms to minimize.
[2024-06-01 22:02:42] [INFO ] Deduced a trap composed of 14 places in 720 ms of which 7 ms to minimize.
[2024-06-01 22:02:43] [INFO ] Deduced a trap composed of 17 places in 716 ms of which 9 ms to minimize.
[2024-06-01 22:02:43] [INFO ] Deduced a trap composed of 42 places in 703 ms of which 8 ms to minimize.
[2024-06-01 22:02:44] [INFO ] Deduced a trap composed of 15 places in 667 ms of which 8 ms to minimize.
[2024-06-01 22:02:45] [INFO ] Deduced a trap composed of 88 places in 749 ms of which 8 ms to minimize.
[2024-06-01 22:02:46] [INFO ] Deduced a trap composed of 32 places in 736 ms of which 8 ms to minimize.
[2024-06-01 22:02:47] [INFO ] Deduced a trap composed of 23 places in 793 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 12/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:02:48] [INFO ] Deduced a trap composed of 11 places in 698 ms of which 8 ms to minimize.
[2024-06-01 22:02:48] [INFO ] Deduced a trap composed of 23 places in 672 ms of which 8 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 2/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1633 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 7/1640 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 7/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:02:50] [INFO ] Deduced a trap composed of 30 places in 654 ms of which 8 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1640 variables, 1/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1640 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 308/1948 variables, 364/1710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:02:51] [INFO ] Deduced a trap composed of 47 places in 635 ms of which 7 ms to minimize.
[2024-06-01 22:02:52] [INFO ] Deduced a trap composed of 20 places in 618 ms of which 7 ms to minimize.
[2024-06-01 22:02:53] [INFO ] Deduced a trap composed of 11 places in 646 ms of which 8 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1948 variables, 3/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1948 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/1948 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1713 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16820 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 18134ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 10288 steps, including 589 resets, run visited all 3 properties in 171 ms. (steps per millisecond=60 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 186 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 133 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:02:55] [INFO ] Computed 23 invariants in 15 ms
[2024-06-01 22:02:57] [INFO ] Implicit Places using invariants in 2292 ms returned []
[2024-06-01 22:02:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:57] [INFO ] Invariant cache hit.
[2024-06-01 22:03:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:03:23] [INFO ] Implicit Places using invariants and state equation in 25356 ms returned []
Implicit Place search using SMT with State Equation took 27651 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:03:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:03:23] [INFO ] Invariant cache hit.
[2024-06-01 22:03:23] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31767ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31833ms
Finished structural reductions in LTL mode , in 1 iterations and 59650 ms. Remains : 1984/1984 places, 3096/3096 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 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 146970 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 3
Probabilistic random walk after 146970 steps, saw 95071 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 22:03:58] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:03:58] [INFO ] Invariant cache hit.
[2024-06-01 22:03:58] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 0/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/3211 variables, 7/2892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3211 variables, 7/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3211 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1533/4744 variables, 1589/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4744/4744 variables, and 4488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3929 ms.
Refiners :[Domain max(s): 1984/1984 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1984/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 3/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:04:07] [INFO ] Deduced a trap composed of 42 places in 2840 ms of which 17 ms to minimize.
[2024-06-01 22:04:09] [INFO ] Deduced a trap composed of 13 places in 2004 ms of which 16 ms to minimize.
SMT process timed out in 10906ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1984 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1089 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1088 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1088 transition count 1753
Deduced a syphon composed of 447 places in 2 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 641 transition count 1753
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2796 place count 586 transition count 1698
Applied a total of 2796 rules in 220 ms. Remains 586 /1984 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 586/1984 places, 1698/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 779 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 421551 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 3
Probabilistic random walk after 421551 steps, saw 63055 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 22:04:13] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-06-01 22:04:13] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 22:04:13] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1687 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:04:16] [INFO ] Deduced a trap composed of 59 places in 864 ms of which 8 ms to minimize.
[2024-06-01 22:04:17] [INFO ] Deduced a trap composed of 33 places in 763 ms of which 9 ms to minimize.
[2024-06-01 22:04:18] [INFO ] Deduced a trap composed of 12 places in 494 ms of which 8 ms to minimize.
[2024-06-01 22:04:19] [INFO ] Deduced a trap composed of 31 places in 713 ms of which 12 ms to minimize.
[2024-06-01 22:04:19] [INFO ] Deduced a trap composed of 50 places in 654 ms of which 9 ms to minimize.
[2024-06-01 22:04:20] [INFO ] Deduced a trap composed of 14 places in 749 ms of which 8 ms to minimize.
[2024-06-01 22:04:21] [INFO ] Deduced a trap composed of 17 places in 759 ms of which 8 ms to minimize.
[2024-06-01 22:04:22] [INFO ] Deduced a trap composed of 42 places in 757 ms of which 7 ms to minimize.
[2024-06-01 22:04:22] [INFO ] Deduced a trap composed of 15 places in 684 ms of which 7 ms to minimize.
[2024-06-01 22:04:23] [INFO ] Deduced a trap composed of 88 places in 574 ms of which 5 ms to minimize.
[2024-06-01 22:04:24] [INFO ] Deduced a trap composed of 32 places in 532 ms of which 5 ms to minimize.
[2024-06-01 22:04:24] [INFO ] Deduced a trap composed of 23 places in 436 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 12/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:04:25] [INFO ] Deduced a trap composed of 11 places in 670 ms of which 8 ms to minimize.
[2024-06-01 22:04:26] [INFO ] Deduced a trap composed of 23 places in 730 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 2/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1633 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 7/1640 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 7/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:04:27] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 5 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1640 variables, 1/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1640 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 308/1948 variables, 364/1710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:04:28] [INFO ] Deduced a trap composed of 47 places in 568 ms of which 7 ms to minimize.
[2024-06-01 22:04:28] [INFO ] Deduced a trap composed of 20 places in 593 ms of which 7 ms to minimize.
[2024-06-01 22:04:29] [INFO ] Deduced a trap composed of 11 places in 703 ms of which 7 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1948 variables, 3/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1948 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/1948 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1713 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16017 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 17750ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 7337 steps, including 430 resets, run visited all 3 properties in 45 ms. (steps per millisecond=163 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 47 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Product exploration explored 100000 steps with 0 reset in 594 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1984 transition count 3096
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 504 place count 1984 transition count 3390
Deduced a syphon composed of 904 places in 3 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 904 place count 1984 transition count 3390
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1107 place count 1781 transition count 3187
Deduced a syphon composed of 701 places in 3 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1310 place count 1781 transition count 3187
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1195 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1804 place count 1781 transition count 3187
Discarding 445 places :
Symmetric choice reduction at 1 with 445 rule applications. Total rules 2249 place count 1336 transition count 2742
Deduced a syphon composed of 750 places in 2 ms
Iterating global reduction 1 with 445 rules applied. Total rules applied 2694 place count 1336 transition count 2742
Deduced a syphon composed of 750 places in 2 ms
Applied a total of 2694 rules in 1076 ms. Remains 1336 /1984 variables (removed 648) and now considering 2742/3096 (removed 354) transitions.
[2024-06-01 22:04:35] [INFO ] Redundant transitions in 283 ms returned []
Running 2734 sub problems to find dead transitions.
[2024-06-01 22:04:35] [INFO ] Flow matrix only has 2406 transitions (discarded 336 similar events)
// Phase 1: matrix 2406 rows 1336 cols
[2024-06-01 22:04:35] [INFO ] Computed 23 invariants in 23 ms
[2024-06-01 22:04:35] [INFO ] State equation strengthened by 791 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/3742 variables, and 23 constraints, problems are : Problem set: 0 solved, 2734 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1336 constraints, ReadFeed: 0/791 constraints, PredecessorRefiner: 2734/2734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
[2024-06-01 22:05:11] [INFO ] Deduced a trap composed of 21 places in 1105 ms of which 11 ms to minimize.
[2024-06-01 22:05:13] [INFO ] Deduced a trap composed of 23 places in 1639 ms of which 15 ms to minimize.
[2024-06-01 22:05:14] [INFO ] Deduced a trap composed of 23 places in 1625 ms of which 17 ms to minimize.
[2024-06-01 22:05:16] [INFO ] Deduced a trap composed of 29 places in 1505 ms of which 11 ms to minimize.
[2024-06-01 22:05:18] [INFO ] Deduced a trap composed of 15 places in 1750 ms of which 12 ms to minimize.
[2024-06-01 22:05:20] [INFO ] Deduced a trap composed of 39 places in 1879 ms of which 18 ms to minimize.
[2024-06-01 22:05:22] [INFO ] Deduced a trap composed of 65 places in 1897 ms of which 18 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 22:05:23] [INFO ] Deduced a trap composed of 65 places in 1478 ms of which 15 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 22:05:25] [INFO ] Deduced a trap composed of 11 places in 1543 ms of which 12 ms to minimize.
[2024-06-01 22:05:26] [INFO ] Deduced a trap composed of 65 places in 1143 ms of which 10 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 22:05:28] [INFO ] Deduced a trap composed of 12 places in 1521 ms of which 18 ms to minimize.
[2024-06-01 22:05:30] [INFO ] Deduced a trap composed of 20 places in 1959 ms of which 17 ms to minimize.
[2024-06-01 22:05:32] [INFO ] Deduced a trap composed of 58 places in 2030 ms of which 20 ms to minimize.
[2024-06-01 22:05:34] [INFO ] Deduced a trap composed of 13 places in 1956 ms of which 18 ms to minimize.
[2024-06-01 22:05:36] [INFO ] Deduced a trap composed of 11 places in 1918 ms of which 19 ms to minimize.
[2024-06-01 22:05:37] [INFO ] Deduced a trap composed of 22 places in 1896 ms of which 17 ms to minimize.
SMT process timed out in 62688ms, After SMT, problems are : Problem set: 0 solved, 2734 unsolved
Search for dead transitions found 0 dead transitions in 62726ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1984 places, 2742/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64106 ms. Remains : 1336/1984 places, 2742/3096 transitions.
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 147 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:05:38] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:05:38] [INFO ] Computed 23 invariants in 13 ms
[2024-06-01 22:05:40] [INFO ] Implicit Places using invariants in 1967 ms returned []
[2024-06-01 22:05:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:05:40] [INFO ] Invariant cache hit.
[2024-06-01 22:05:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:06:03] [INFO ] Implicit Places using invariants and state equation in 23617 ms returned []
Implicit Place search using SMT with State Equation took 25586 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:06:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:06:03] [INFO ] Invariant cache hit.
[2024-06-01 22:06:03] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31867ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31911ms
Finished structural reductions in LTL mode , in 1 iterations and 57656 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 259571 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)) U G(p2)))))'
Support contains 4 out of 1985 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 1985 transition count 2204
Reduce places removed 892 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 894 rules applied. Total rules applied 1786 place count 1093 transition count 2202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1788 place count 1091 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1788 place count 1091 transition count 1756
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2680 place count 645 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2792 place count 589 transition count 1700
Applied a total of 2792 rules in 207 ms. Remains 589 /1985 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
[2024-06-01 22:06:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 589 cols
[2024-06-01 22:06:36] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 22:06:37] [INFO ] Implicit Places using invariants in 1204 ms returned [580]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1206 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/1985 places, 1700/3096 transitions.
Applied a total of 0 rules in 40 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1453 ms. Remains : 588/1985 places, 1700/3096 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 365 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-10 finished in 2091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 158 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:06:38] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1985 cols
[2024-06-01 22:06:38] [INFO ] Computed 24 invariants in 8 ms
[2024-06-01 22:06:39] [INFO ] Implicit Places using invariants in 1413 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1415 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 112 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1686 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11
Product exploration explored 100000 steps with 175 reset in 482 ms.
Stack based approach found an accepted trace after 2035 steps with 4 reset with depth 495 and stack size 495 in 13 ms.
FORMULA Peterson-PT-7-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 2344 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((X((p0&&G(p1)))&&(p2 U X(G(p3)))))))'
Support contains 5 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 128 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:06:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:06:40] [INFO ] Invariant cache hit.
[2024-06-01 22:06:42] [INFO ] Implicit Places using invariants in 1745 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1747 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 110 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1985 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 2264 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||X((G(F(p1)) U p2)))))'
Found a Lengthening insensitive property : Peterson-PT-7-LTLFireability-09
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1985 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1090 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1089 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1089 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 642 transition count 1753
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2796 place count 587 transition count 1698
Applied a total of 2796 rules in 131 ms. Remains 587 /1985 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
[2024-06-01 22:06:43] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 587 cols
[2024-06-01 22:06:43] [INFO ] Computed 24 invariants in 2 ms
[2024-06-01 22:06:44] [INFO ] Implicit Places using invariants in 831 ms returned [578]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 833 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 586/1985 places, 1698/3096 transitions.
Applied a total of 0 rules in 25 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 990 ms. Remains : 586/1985 places, 1698/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 315 ms.
Product exploration explored 100000 steps with 0 reset in 432 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 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 330372 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 3
Probabilistic random walk after 330372 steps, saw 54686 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-01 22:06:48] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-06-01 22:06:48] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 22:06:48] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1580 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:06:51] [INFO ] Deduced a trap composed of 59 places in 758 ms of which 8 ms to minimize.
[2024-06-01 22:06:52] [INFO ] Deduced a trap composed of 33 places in 724 ms of which 7 ms to minimize.
[2024-06-01 22:06:53] [INFO ] Deduced a trap composed of 12 places in 763 ms of which 9 ms to minimize.
[2024-06-01 22:06:54] [INFO ] Deduced a trap composed of 31 places in 757 ms of which 11 ms to minimize.
[2024-06-01 22:06:55] [INFO ] Deduced a trap composed of 50 places in 672 ms of which 9 ms to minimize.
[2024-06-01 22:06:55] [INFO ] Deduced a trap composed of 14 places in 786 ms of which 9 ms to minimize.
SMT process timed out in 7295ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 49 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 586/586 places, 1698/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 536 ms. (74 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 391446 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 3
Probabilistic random walk after 391446 steps, saw 60205 distinct states, run finished after 3004 ms. (steps per millisecond=130 ) properties seen :0
[2024-06-01 22:06:59] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:06:59] [INFO ] Invariant cache hit.
[2024-06-01 22:06:59] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1693 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:07:02] [INFO ] Deduced a trap composed of 21 places in 783 ms of which 8 ms to minimize.
[2024-06-01 22:07:03] [INFO ] Deduced a trap composed of 41 places in 794 ms of which 9 ms to minimize.
[2024-06-01 22:07:04] [INFO ] Deduced a trap composed of 43 places in 784 ms of which 8 ms to minimize.
[2024-06-01 22:07:05] [INFO ] Deduced a trap composed of 12 places in 832 ms of which 8 ms to minimize.
[2024-06-01 22:07:06] [INFO ] Deduced a trap composed of 23 places in 795 ms of which 9 ms to minimize.
[2024-06-01 22:07:07] [INFO ] Deduced a trap composed of 11 places in 800 ms of which 8 ms to minimize.
[2024-06-01 22:07:07] [INFO ] Deduced a trap composed of 31 places in 765 ms of which 9 ms to minimize.
[2024-06-01 22:07:08] [INFO ] Deduced a trap composed of 22 places in 754 ms of which 8 ms to minimize.
[2024-06-01 22:07:09] [INFO ] Deduced a trap composed of 78 places in 732 ms of which 7 ms to minimize.
[2024-06-01 22:07:10] [INFO ] Deduced a trap composed of 14 places in 718 ms of which 8 ms to minimize.
[2024-06-01 22:07:10] [INFO ] Deduced a trap composed of 17 places in 697 ms of which 8 ms to minimize.
[2024-06-01 22:07:11] [INFO ] Deduced a trap composed of 42 places in 752 ms of which 8 ms to minimize.
[2024-06-01 22:07:12] [INFO ] Deduced a trap composed of 24 places in 630 ms of which 7 ms to minimize.
[2024-06-01 22:07:13] [INFO ] Deduced a trap composed of 15 places in 645 ms of which 8 ms to minimize.
[2024-06-01 22:07:13] [INFO ] Deduced a trap composed of 30 places in 718 ms of which 8 ms to minimize.
[2024-06-01 22:07:14] [INFO ] Deduced a trap composed of 45 places in 698 ms of which 8 ms to minimize.
[2024-06-01 22:07:15] [INFO ] Deduced a trap composed of 15 places in 708 ms of which 8 ms to minimize.
[2024-06-01 22:07:16] [INFO ] Deduced a trap composed of 14 places in 694 ms of which 8 ms to minimize.
[2024-06-01 22:07:16] [INFO ] Deduced a trap composed of 46 places in 653 ms of which 7 ms to minimize.
[2024-06-01 22:07:17] [INFO ] Deduced a trap composed of 21 places in 723 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 7/1640 variables, 7/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1640 variables, 7/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 308/1948 variables, 364/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18362 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 20076ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 441 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 586 transition count 1697
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 2 place count 585 transition count 1697
Applied a total of 2 rules in 58 ms. Remains 585 /586 variables (removed 1) and now considering 1697/1698 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 585/586 places, 1697/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 535689 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 535689 steps, saw 78030 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2024-06-01 22:07:22] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
// Phase 1: matrix 1361 rows 585 cols
[2024-06-01 22:07:22] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:07:22] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 65/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 171/238 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/637 variables, 56/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1274 variables, 98/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 98/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1274 variables, 483/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1274 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1631 variables, 7/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1631 variables, 357/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1631 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1638 variables, 7/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1638 variables, 7/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1638 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1946 variables, 364/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1946 variables, 0/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1946 variables, 0/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1946/1946 variables, and 1690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 942 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 585/585 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 65/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 171/238 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/637 variables, 56/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1274 variables, 98/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 98/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1274 variables, 483/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1274 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1631 variables, 7/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1631 variables, 357/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1631 variables, 1/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:07:25] [INFO ] Deduced a trap composed of 34 places in 822 ms of which 9 ms to minimize.
[2024-06-01 22:07:26] [INFO ] Deduced a trap composed of 11 places in 784 ms of which 8 ms to minimize.
[2024-06-01 22:07:27] [INFO ] Deduced a trap composed of 30 places in 737 ms of which 5 ms to minimize.
[2024-06-01 22:07:27] [INFO ] Deduced a trap composed of 41 places in 655 ms of which 6 ms to minimize.
[2024-06-01 22:07:28] [INFO ] Deduced a trap composed of 45 places in 640 ms of which 6 ms to minimize.
[2024-06-01 22:07:29] [INFO ] Deduced a trap composed of 61 places in 610 ms of which 9 ms to minimize.
[2024-06-01 22:07:29] [INFO ] Deduced a trap composed of 33 places in 725 ms of which 5 ms to minimize.
[2024-06-01 22:07:30] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 5 ms to minimize.
[2024-06-01 22:07:30] [INFO ] Deduced a trap composed of 24 places in 416 ms of which 5 ms to minimize.
[2024-06-01 22:07:31] [INFO ] Deduced a trap composed of 22 places in 438 ms of which 5 ms to minimize.
[2024-06-01 22:07:31] [INFO ] Deduced a trap composed of 23 places in 637 ms of which 8 ms to minimize.
[2024-06-01 22:07:32] [INFO ] Deduced a trap composed of 25 places in 705 ms of which 8 ms to minimize.
[2024-06-01 22:07:33] [INFO ] Deduced a trap composed of 16 places in 736 ms of which 9 ms to minimize.
[2024-06-01 22:07:34] [INFO ] Deduced a trap composed of 47 places in 750 ms of which 8 ms to minimize.
[2024-06-01 22:07:34] [INFO ] Deduced a trap composed of 23 places in 740 ms of which 8 ms to minimize.
[2024-06-01 22:07:35] [INFO ] Deduced a trap composed of 63 places in 666 ms of which 8 ms to minimize.
[2024-06-01 22:07:36] [INFO ] Deduced a trap composed of 14 places in 658 ms of which 8 ms to minimize.
[2024-06-01 22:07:37] [INFO ] Deduced a trap composed of 59 places in 597 ms of which 7 ms to minimize.
[2024-06-01 22:07:37] [INFO ] Deduced a trap composed of 13 places in 626 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1631 variables, 19/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1631 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/1638 variables, 7/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1638 variables, 7/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1638 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1946 variables, 364/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1946 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1946 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1946/1946 variables, and 1710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14576 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 585/585 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 15544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1697/1697 transitions.
Applied a total of 0 rules in 48 ms. Remains 585 /585 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 585/585 places, 1697/1697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1697/1697 transitions.
Applied a total of 0 rules in 55 ms. Remains 585 /585 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
[2024-06-01 22:07:38] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
[2024-06-01 22:07:38] [INFO ] Invariant cache hit.
[2024-06-01 22:07:39] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2024-06-01 22:07:39] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
[2024-06-01 22:07:39] [INFO ] Invariant cache hit.
[2024-06-01 22:07:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:07:44] [INFO ] Implicit Places using invariants and state equation in 4643 ms returned []
Implicit Place search using SMT with State Equation took 6017 ms to find 0 implicit places.
[2024-06-01 22:07:44] [INFO ] Redundant transitions in 185 ms returned []
Running 1689 sub problems to find dead transitions.
[2024-06-01 22:07:44] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
[2024-06-01 22:07:44] [INFO ] Invariant cache hit.
[2024-06-01 22:07:44] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 585/585 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
SMT process timed out in 31088ms, After SMT, problems are : Problem set: 0 solved, 1689 unsolved
Search for dead transitions found 0 dead transitions in 31120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37393 ms. Remains : 585/585 places, 1697/1697 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1287 edges and 585 vertex of which 448 / 585 are part of one of the 56 SCC in 7 ms
Free SCC test removed 392 places
Drop transitions (Empty/Sink Transition effects.) removed 784 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1175 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 193 transition count 467
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 138 transition count 467
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 135 place count 122 transition count 459
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 151 place count 114 transition count 451
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 159 place count 58 transition count 451
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 217 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 266 place count 2 transition count 2
Applied a total of 266 rules in 77 ms. Remains 2 /585 variables (removed 583) and now considering 2/1697 (removed 1695) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 22:08:16] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 22:08:16] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:08:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 22:08:16] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:08:16] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:08:16] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 176 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 27 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-06-01 22:08:16] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-06-01 22:08:16] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 22:08:18] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2024-06-01 22:08:18] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:08:18] [INFO ] Invariant cache hit.
[2024-06-01 22:08:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:08:23] [INFO ] Implicit Places using invariants and state equation in 4913 ms returned []
Implicit Place search using SMT with State Equation took 6297 ms to find 0 implicit places.
Running 1690 sub problems to find dead transitions.
[2024-06-01 22:08:23] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:08:23] [INFO ] Invariant cache hit.
[2024-06-01 22:08:23] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
SMT process timed out in 30843ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 30864ms
Finished structural reductions in LTL mode , in 1 iterations and 37197 ms. Remains : 586/586 places, 1698/1698 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 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 368334 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 3
Probabilistic random walk after 368334 steps, saw 58139 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-06-01 22:08:57] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:08:57] [INFO ] Invariant cache hit.
[2024-06-01 22:08:57] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1263 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:09:00] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 5 ms to minimize.
[2024-06-01 22:09:01] [INFO ] Deduced a trap composed of 41 places in 549 ms of which 7 ms to minimize.
[2024-06-01 22:09:01] [INFO ] Deduced a trap composed of 43 places in 621 ms of which 8 ms to minimize.
[2024-06-01 22:09:02] [INFO ] Deduced a trap composed of 12 places in 687 ms of which 6 ms to minimize.
[2024-06-01 22:09:03] [INFO ] Deduced a trap composed of 23 places in 705 ms of which 7 ms to minimize.
[2024-06-01 22:09:03] [INFO ] Deduced a trap composed of 11 places in 798 ms of which 8 ms to minimize.
[2024-06-01 22:09:04] [INFO ] Deduced a trap composed of 31 places in 763 ms of which 8 ms to minimize.
SMT process timed out in 7025ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 51 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 586/586 places, 1698/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 1877 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 394137 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 3
Probabilistic random walk after 394137 steps, saw 60495 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-06-01 22:09:08] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:09:08] [INFO ] Invariant cache hit.
[2024-06-01 22:09:08] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1405 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:09:12] [INFO ] Deduced a trap composed of 21 places in 802 ms of which 8 ms to minimize.
[2024-06-01 22:09:12] [INFO ] Deduced a trap composed of 41 places in 810 ms of which 9 ms to minimize.
[2024-06-01 22:09:13] [INFO ] Deduced a trap composed of 43 places in 805 ms of which 9 ms to minimize.
[2024-06-01 22:09:14] [INFO ] Deduced a trap composed of 12 places in 821 ms of which 8 ms to minimize.
[2024-06-01 22:09:15] [INFO ] Deduced a trap composed of 23 places in 696 ms of which 7 ms to minimize.
[2024-06-01 22:09:16] [INFO ] Deduced a trap composed of 11 places in 742 ms of which 7 ms to minimize.
[2024-06-01 22:09:16] [INFO ] Deduced a trap composed of 31 places in 718 ms of which 8 ms to minimize.
[2024-06-01 22:09:17] [INFO ] Deduced a trap composed of 22 places in 820 ms of which 8 ms to minimize.
[2024-06-01 22:09:18] [INFO ] Deduced a trap composed of 78 places in 794 ms of which 9 ms to minimize.
[2024-06-01 22:09:19] [INFO ] Deduced a trap composed of 14 places in 826 ms of which 9 ms to minimize.
[2024-06-01 22:09:20] [INFO ] Deduced a trap composed of 17 places in 804 ms of which 8 ms to minimize.
[2024-06-01 22:09:21] [INFO ] Deduced a trap composed of 42 places in 730 ms of which 8 ms to minimize.
[2024-06-01 22:09:21] [INFO ] Deduced a trap composed of 24 places in 752 ms of which 8 ms to minimize.
[2024-06-01 22:09:22] [INFO ] Deduced a trap composed of 15 places in 771 ms of which 8 ms to minimize.
[2024-06-01 22:09:23] [INFO ] Deduced a trap composed of 30 places in 797 ms of which 8 ms to minimize.
[2024-06-01 22:09:24] [INFO ] Deduced a trap composed of 45 places in 790 ms of which 8 ms to minimize.
[2024-06-01 22:09:25] [INFO ] Deduced a trap composed of 15 places in 758 ms of which 9 ms to minimize.
[2024-06-01 22:09:25] [INFO ] Deduced a trap composed of 14 places in 816 ms of which 8 ms to minimize.
[2024-06-01 22:09:26] [INFO ] Deduced a trap composed of 46 places in 787 ms of which 9 ms to minimize.
[2024-06-01 22:09:27] [INFO ] Deduced a trap composed of 21 places in 759 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 7/1640 variables, 7/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1640 variables, 7/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 308/1948 variables, 364/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 19274 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 20696ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 344 ms.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 49 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 586/586 places, 1698/1698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 49 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-06-01 22:09:29] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:09:29] [INFO ] Invariant cache hit.
[2024-06-01 22:09:30] [INFO ] Implicit Places using invariants in 932 ms returned []
[2024-06-01 22:09:30] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:09:30] [INFO ] Invariant cache hit.
[2024-06-01 22:09:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:09:36] [INFO ] Implicit Places using invariants and state equation in 5639 ms returned []
Implicit Place search using SMT with State Equation took 6578 ms to find 0 implicit places.
[2024-06-01 22:09:36] [INFO ] Redundant transitions in 73 ms returned []
Running 1690 sub problems to find dead transitions.
[2024-06-01 22:09:36] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:09:36] [INFO ] Invariant cache hit.
[2024-06-01 22:09:36] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
[2024-06-01 22:10:08] [INFO ] Deduced a trap composed of 72 places in 747 ms of which 10 ms to minimize.
SMT process timed out in 31565ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 31594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38313 ms. Remains : 586/586 places, 1698/1698 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1286 edges and 586 vertex of which 446 / 586 are part of one of the 56 SCC in 1 ms
Free SCC test removed 390 places
Drop transitions (Empty/Sink Transition effects.) removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 196 transition count 474
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 142 transition count 474
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 140 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 137 place count 124 transition count 463
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 153 place count 116 transition count 455
Graph (trivial) has 58 edges and 116 vertex of which 58 / 116 are part of one of the 8 SCC in 1 ms
Free SCC test removed 50 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 161 place count 59 transition count 455
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 403 edges and 59 vertex of which 3 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 0 with 60 rules applied. Total rules applied 221 place count 3 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 270 place count 3 transition count 4
Applied a total of 270 rules in 51 ms. Remains 3 /586 variables (removed 583) and now considering 4/1698 (removed 1694) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 22:10:08] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 22:10:08] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 22:10:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 22:10:08] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 22:10:08] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 22:10:08] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 148 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 455 ms.
Product exploration explored 100000 steps with 0 reset in 454 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 46 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-06-01 22:10:10] [INFO ] Redundant transitions in 54 ms returned []
Running 1690 sub problems to find dead transitions.
[2024-06-01 22:10:10] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-06-01 22:10:10] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:10:10] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
[2024-06-01 22:10:41] [INFO ] Deduced a trap composed of 72 places in 721 ms of which 8 ms to minimize.
SMT process timed out in 31417ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 31450ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31564 ms. Remains : 586/586 places, 1698/1698 transitions.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 20 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-06-01 22:10:41] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:10:41] [INFO ] Invariant cache hit.
[2024-06-01 22:10:42] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-06-01 22:10:42] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:10:42] [INFO ] Invariant cache hit.
[2024-06-01 22:10:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:10:48] [INFO ] Implicit Places using invariants and state equation in 5612 ms returned []
Implicit Place search using SMT with State Equation took 6615 ms to find 0 implicit places.
Running 1690 sub problems to find dead transitions.
[2024-06-01 22:10:48] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-06-01 22:10:48] [INFO ] Invariant cache hit.
[2024-06-01 22:10:48] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
SMT process timed out in 31095ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 31130ms
Finished structural reductions in LTL mode , in 1 iterations and 37772 ms. Remains : 586/586 places, 1698/1698 transitions.
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 276825 ms.
[2024-06-01 22:11:19] [INFO ] Flatten gal took : 167 ms
[2024-06-01 22:11:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 22:11:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1985 places, 3096 transitions and 9570 arcs took 31 ms.
Total runtime 768715 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="Peterson-PT-7"
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 Peterson-PT-7, 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 r512-smll-171654407300292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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