About the Execution of LTSMin+red for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1601.184 | 1171533.00 | 2314489.00 | 2707.10 | ?TTFFTTFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266300179.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 EisenbergMcGuire-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300179
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717226037411
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:00] [INFO ] Load time of PNML (sax parser for PT used): 648 ms
[2024-06-01 07:14:00] [INFO ] Transformed 553 places.
[2024-06-01 07:14:00] [INFO ] Transformed 1960 transitions.
[2024-06-01 07:14:00] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:01] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 961 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 513 transition count 1680
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 513 transition count 1680
Applied a total of 80 rules in 270 ms. Remains 513 /553 variables (removed 40) and now considering 1680/1960 (removed 280) transitions.
[2024-06-01 07:14:01] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
// Phase 1: matrix 721 rows 513 cols
[2024-06-01 07:14:01] [INFO ] Computed 22 invariants in 48 ms
[2024-06-01 07:14:03] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2024-06-01 07:14:03] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-06-01 07:14:03] [INFO ] Invariant cache hit.
[2024-06-01 07:14:03] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:14:07] [INFO ] Implicit Places using invariants and state equation in 3798 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-06-01 07:14:07] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-06-01 07:14:07] [INFO ] Invariant cache hit.
[2024-06-01 07:14:07] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 34 ms to minimize.
SMT process timed out in 31827ms, After SMT, problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 31915ms
Starting structural reductions in LTL mode, iteration 1 : 513/553 places, 1680/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37610 ms. Remains : 513/553 places, 1680/1960 transitions.
Support contains 18 out of 513 places after structural reductions.
[2024-06-01 07:14:39] [INFO ] Flatten gal took : 222 ms
[2024-06-01 07:14:39] [INFO ] Flatten gal took : 131 ms
[2024-06-01 07:14:40] [INFO ] Input system was already deterministic with 1680 transitions.
RANDOM walk for 40000 steps (8 resets) in 1658 ms. (24 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 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
[2024-06-01 07:14:40] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-06-01 07:14:40] [INFO ] Invariant cache hit.
[2024-06-01 07:14:40] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 390/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/423 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/434 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 620/1054 variables, 434/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1054 variables, 102/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 19/1073 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 64/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1073 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 20/1093 variables, 9/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1093 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1093 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 61/1154 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1154 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1156 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1156 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 78/1234 variables, 63/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1234 variables, 58/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 767 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 390/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/423 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/434 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 3 places in 1341 ms of which 5 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 620/1054 variables, 434/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 102/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1054 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 19/1073 variables, 7/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1073 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1073 variables, 64/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1073 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 20/1093 variables, 9/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1093 variables, 8/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 61/1154 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1154 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1156 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1156 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1156 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1156 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 78/1234 variables, 63/716 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1234 variables, 58/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1234 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1234 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 774 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 6199ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 897 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 400 place count 313 transition count 1480
Applied a total of 400 rules in 360 ms. Remains 313 /513 variables (removed 200) and now considering 1480/1680 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 313/513 places, 1480/1680 transitions.
RANDOM walk for 40000 steps (8 resets) in 514 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
[2024-06-01 07:14:48] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
// Phase 1: matrix 521 rows 313 cols
[2024-06-01 07:14:48] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:14:48] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 449/712 variables, 263/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 102/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/731 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 64/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/751 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/751 variables, 9/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/783 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/783 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/785 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/785 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 49/834 variables, 34/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/834 variables, 57/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 449/712 variables, 263/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 102/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/731 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 64/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/731 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 20/751 variables, 9/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 9/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/751 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 32/783 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/783 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/785 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/785 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/785 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/785 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/834 variables, 34/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/834 variables, 57/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/834 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/834 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 574 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 2846ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 587 ms.
Support contains 8 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 1480/1480 transitions.
Applied a total of 0 rules in 86 ms. Remains 313 /313 variables (removed 0) and now considering 1480/1480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 313/313 places, 1480/1480 transitions.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 253256 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 253256 steps, saw 113211 distinct states, run finished after 3008 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 07:14:55] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2024-06-01 07:14:55] [INFO ] Invariant cache hit.
[2024-06-01 07:14:55] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 449/712 variables, 263/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 102/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/731 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 64/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/751 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/751 variables, 9/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/783 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/783 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/785 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/785 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 49/834 variables, 34/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/834 variables, 57/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 449/712 variables, 263/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 102/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/731 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 64/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/731 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 20/751 variables, 9/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 9/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/751 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 32/783 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/783 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/785 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/785 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/785 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/834 variables, 34/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/834 variables, 57/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/834 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/834 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 571 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1975ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 32 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 1480/1480 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 313 transition count 1478
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 1478
Applied a total of 4 rules in 59 ms. Remains 311 /313 variables (removed 2) and now considering 1478/1480 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 311/313 places, 1478/1480 transitions.
RANDOM walk for 40000 steps (8 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 535792 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 535792 steps, saw 190701 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2024-06-01 07:15:00] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-06-01 07:15:00] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 07:15:00] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1888ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 45 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 46 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-06-01 07:15:02] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:15:02] [INFO ] Invariant cache hit.
[2024-06-01 07:15:03] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-01 07:15:03] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:15:03] [INFO ] Invariant cache hit.
[2024-06-01 07:15:03] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:15:05] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
[2024-06-01 07:15:05] [INFO ] Redundant transitions in 158 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-06-01 07:15:05] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:15:05] [INFO ] Invariant cache hit.
[2024-06-01 07:15:05] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 5 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 4 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 64 places in 344 ms of which 4 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 61 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 66 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 4 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 5 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 67 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 4 ms to minimize.
SMT process timed out in 31699ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34702 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 11 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 104 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-06-01 07:15:37] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 07:15:37] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:15:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 07:15:37] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:15:37] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:15:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:15:37] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:15:37] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:15:37] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 417 ms.
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' '!(X((G(p0)||G(F(p1)))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Applied a total of 0 rules in 21 ms. Remains 513 /513 variables (removed 0) and now considering 1680/1680 (removed 0) transitions.
[2024-06-01 07:15:37] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
// Phase 1: matrix 721 rows 513 cols
[2024-06-01 07:15:37] [INFO ] Computed 22 invariants in 13 ms
[2024-06-01 07:15:38] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-06-01 07:15:38] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-06-01 07:15:38] [INFO ] Invariant cache hit.
[2024-06-01 07:15:39] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:15:42] [INFO ] Implicit Places using invariants and state equation in 3929 ms returned []
Implicit Place search using SMT with State Equation took 4762 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-06-01 07:15:42] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-06-01 07:15:42] [INFO ] Invariant cache hit.
[2024-06-01 07:15:42] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 4 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 32 places in 325 ms of which 5 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 7 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 5 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 36 places in 539 ms of which 6 ms to minimize.
SMT process timed out in 31735ms, After SMT, problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 31769ms
Finished structural reductions in LTL mode , in 1 iterations and 36561 ms. Remains : 513/513 places, 1680/1680 transitions.
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 587 ms.
Product exploration explored 100000 steps with 0 reset in 414 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
[2024-06-01 07:16:16] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-06-01 07:16:16] [INFO ] Invariant cache hit.
[2024-06-01 07:16:16] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 275/281 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/290 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 418/708 variables, 290/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 44/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/751 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 48/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/811 variables, 27/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/811 variables, 16/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 182/993 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/993 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/995 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/995 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 5/1000 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1000 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 234/1234 variables, 189/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1234 variables, 124/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 767 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 275/281 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/290 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 418/708 variables, 290/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 44/346 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/751 variables, 7/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 1/354 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 48/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 60/811 variables, 27/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/811 variables, 16/445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 182/993 variables, 5/450 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/993 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/995 variables, 1/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/995 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/1000 variables, 3/454 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1000 variables, 1/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1000 variables, 4/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1000 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 234/1234 variables, 189/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1234 variables, 124/772 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1234 variables, 0/772 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1234 variables, 0/772 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 772 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 3086ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 506 transition count 1520
Deduced a syphon composed of 153 places in 2 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 353 transition count 1520
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 311 transition count 1478
Applied a total of 404 rules in 159 ms. Remains 311 /513 variables (removed 202) and now considering 1478/1680 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 311/513 places, 1478/1680 transitions.
RANDOM walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475856 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475856 steps, saw 179933 distinct states, run finished after 3004 ms. (steps per millisecond=158 ) properties seen :0
[2024-06-01 07:16:22] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-06-01 07:16:22] [INFO ] Computed 22 invariants in 10 ms
[2024-06-01 07:16:22] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2001 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2535ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 71 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 62 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-06-01 07:16:25] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:16:25] [INFO ] Invariant cache hit.
[2024-06-01 07:16:26] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-06-01 07:16:26] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:16:26] [INFO ] Invariant cache hit.
[2024-06-01 07:16:26] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:16:28] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2024-06-01 07:16:28] [INFO ] Redundant transitions in 159 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-06-01 07:16:28] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:16:28] [INFO ] Invariant cache hit.
[2024-06-01 07:16:28] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 3 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 61 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 59 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 5 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 60 places in 295 ms of which 5 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 64 places in 362 ms of which 4 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 46 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 58 places in 354 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 63 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 50 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 54 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 41 places in 364 ms of which 5 ms to minimize.
SMT process timed out in 31065ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31095ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34344 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 3 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 61 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-06-01 07:17:00] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 07:17:00] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:17:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 07:17:00] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:17:00] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:17:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:17:00] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:17:00] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:17:00] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 302 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 264 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 398 place count 314 transition count 1481
Applied a total of 398 rules in 189 ms. Remains 314 /513 variables (removed 199) and now considering 1481/1680 (removed 199) transitions.
[2024-06-01 07:17:01] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-06-01 07:17:01] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 07:17:01] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-01 07:17:01] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:17:01] [INFO ] Invariant cache hit.
[2024-06-01 07:17:02] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:17:04] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 3141 ms to find 0 implicit places.
[2024-06-01 07:17:04] [INFO ] Redundant transitions in 69 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-06-01 07:17:04] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:17:04] [INFO ] Invariant cache hit.
[2024-06-01 07:17:04] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 4 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 44 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 74 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 5 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 42 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 5 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 5 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 4 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 5 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 4 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 4 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 69 places in 451 ms of which 4 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 57 places in 455 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 62 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 40/40 constraints]
After SMT, in 61332ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 61359ms
Starting structural reductions in SI_LTL mode, iteration 1 : 314/513 places, 1481/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64773 ms. Remains : 314/513 places, 1481/1680 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
[2024-06-01 07:18:06] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:18:06] [INFO ] Invariant cache hit.
[2024-06-01 07:18:06] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/484 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 44/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/527 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/587 variables, 27/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/683 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/689 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 147/836 variables, 102/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/836 variables, 122/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/484 variables, 178/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 44/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/527 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 48/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/587 variables, 27/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 18/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 96/683 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/683 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/689 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 44 places in 354 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 4/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 147/836 variables, 102/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/836 variables, 122/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/836 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3844ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 314 transition count 1479
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 96 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 311/314 places, 1478/1481 transitions.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409296 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409296 steps, saw 155475 distinct states, run finished after 3005 ms. (steps per millisecond=136 ) properties seen :0
[2024-06-01 07:18:13] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-06-01 07:18:13] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:18:13] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 27 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 5 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 66 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3800 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 66 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 63 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-06-01 07:18:17] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:18:17] [INFO ] Invariant cache hit.
[2024-06-01 07:18:18] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-06-01 07:18:18] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:18:18] [INFO ] Invariant cache hit.
[2024-06-01 07:18:19] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:18:20] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
[2024-06-01 07:18:20] [INFO ] Redundant transitions in 27 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-06-01 07:18:20] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:18:20] [INFO ] Invariant cache hit.
[2024-06-01 07:18:20] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 68 places in 324 ms of which 5 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 56 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 5 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 4 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 10 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 4 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 60 places in 288 ms of which 5 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 5 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 5 ms to minimize.
SMT process timed out in 31685ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31713ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34370 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 3 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 43 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-06-01 07:18:52] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 07:18:52] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:18:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 07:18:52] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:18:52] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:18:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:18:52] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:18:52] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:18:52] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 324 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 204 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 389 ms.
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 39 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2024-06-01 07:18:54] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-06-01 07:18:54] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:18:54] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 07:18:54] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:18:54] [INFO ] Invariant cache hit.
[2024-06-01 07:18:55] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:18:56] [INFO ] Implicit Places using invariants and state equation in 2363 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2024-06-01 07:18:57] [INFO ] Redundant transitions in 43 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-06-01 07:18:57] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:18:57] [INFO ] Invariant cache hit.
[2024-06-01 07:18:57] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 3 places in 524 ms of which 5 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 5 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 43 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 39 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 74 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 5 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 42 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 6 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 21 places in 434 ms of which 5 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 5 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 4 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 69 places in 344 ms of which 5 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 57 places in 367 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 62 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 40/40 constraints]
After SMT, in 61018ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 61045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64091 ms. Remains : 314/314 places, 1481/1481 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 260570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((G(p2)||p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 506 transition count 1521
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 354 transition count 1521
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 320 place count 352 transition count 1507
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 352 transition count 1507
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 310 transition count 1465
Applied a total of 406 rules in 135 ms. Remains 310 /513 variables (removed 203) and now considering 1465/1680 (removed 215) transitions.
[2024-06-01 07:19:58] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2024-06-01 07:19:58] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:19:59] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-06-01 07:19:59] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-06-01 07:19:59] [INFO ] Invariant cache hit.
[2024-06-01 07:19:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:20:01] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
[2024-06-01 07:20:01] [INFO ] Redundant transitions in 47 ms returned []
Running 1458 sub problems to find dead transitions.
[2024-06-01 07:20:01] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-06-01 07:20:01] [INFO ] Invariant cache hit.
[2024-06-01 07:20:01] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 5 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 4 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 56 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 62 places in 330 ms of which 5 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/816 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 5 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 4 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 19 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 5 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 4 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 5 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 19 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/816 variables, and 63 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 41/41 constraints]
After SMT, in 61172ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 61197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/513 places, 1465/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64418 ms. Remains : 310/513 places, 1465/1680 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 350 ms.
Stack based approach found an accepted trace after 1643 steps with 0 reset with depth 1644 and stack size 1380 in 9 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-03 finished in 65030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 506 transition count 1521
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 354 transition count 1521
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 320 place count 352 transition count 1507
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 352 transition count 1507
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 310 transition count 1465
Applied a total of 406 rules in 136 ms. Remains 310 /513 variables (removed 203) and now considering 1465/1680 (removed 215) transitions.
[2024-06-01 07:21:03] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2024-06-01 07:21:03] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:21:04] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-06-01 07:21:04] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-06-01 07:21:04] [INFO ] Invariant cache hit.
[2024-06-01 07:21:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:21:06] [INFO ] Implicit Places using invariants and state equation in 2169 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2024-06-01 07:21:06] [INFO ] Redundant transitions in 46 ms returned []
Running 1458 sub problems to find dead transitions.
[2024-06-01 07:21:06] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-06-01 07:21:06] [INFO ] Invariant cache hit.
[2024-06-01 07:21:06] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 6 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 38 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 5 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 4 ms to minimize.
(s31 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/816 variables, and 45 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 68 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 5 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 56 places in 355 ms of which 5 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 55 places in 389 ms of which 4 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 5 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 90 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 64 places in 429 ms of which 5 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 40 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 73 places in 428 ms of which 5 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 83 places in 425 ms of which 5 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 47 places in 417 ms of which 5 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 94 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 78 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 68 places in 416 ms of which 5 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 85 places in 351 ms of which 4 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 87 places in 332 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/816 variables, and 68 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 46/46 constraints]
After SMT, in 61207ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 61234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/513 places, 1465/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64371 ms. Remains : 310/513 places, 1465/1680 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 332 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-09 finished in 64798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 14 place count 506 transition count 1523
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 314 place count 356 transition count 1523
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 316 place count 354 transition count 1509
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 354 transition count 1509
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 402 place count 312 transition count 1467
Applied a total of 402 rules in 129 ms. Remains 312 /513 variables (removed 201) and now considering 1467/1680 (removed 213) transitions.
[2024-06-01 07:22:08] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
// Phase 1: matrix 508 rows 312 cols
[2024-06-01 07:22:08] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 07:22:09] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-06-01 07:22:09] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2024-06-01 07:22:09] [INFO ] Invariant cache hit.
[2024-06-01 07:22:09] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:22:11] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2802 ms to find 0 implicit places.
[2024-06-01 07:22:11] [INFO ] Redundant transitions in 46 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-06-01 07:22:11] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2024-06-01 07:22:11] [INFO ] Invariant cache hit.
[2024-06-01 07:22:11] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 6 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 52 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 4 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 72 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 80 places in 320 ms of which 4 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 4 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 5 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 37 places in 424 ms of which 5 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 4 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 65 places in 349 ms of which 5 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 55 places in 382 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 60 places in 285 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/820 variables, and 47 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/312 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 53 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 5 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 16 places in 325 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 55 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 26 places in 369 ms of which 5 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 5 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 19 places in 368 ms of which 4 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 4 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/820 variables, and 67 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/312 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 45/45 constraints]
After SMT, in 61321ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 61347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/513 places, 1467/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64343 ms. Remains : 312/513 places, 1467/1680 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 772 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-11 finished in 65435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLCardinality-00
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 398 place count 314 transition count 1481
Applied a total of 398 rules in 74 ms. Remains 314 /513 variables (removed 199) and now considering 1481/1680 (removed 199) transitions.
[2024-06-01 07:23:14] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-06-01 07:23:14] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:23:15] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-06-01 07:23:15] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:23:15] [INFO ] Invariant cache hit.
[2024-06-01 07:23:15] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:23:17] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
Running 1474 sub problems to find dead transitions.
[2024-06-01 07:23:17] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:23:17] [INFO ] Invariant cache hit.
[2024-06-01 07:23:17] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 40 places in 300 ms of which 3 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 44 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:23:43] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 42 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 4 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 5 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 5 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 17 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 4 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 7 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 69 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 57 places in 477 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 62 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 40/40 constraints]
After SMT, in 61159ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Starting structural reductions in LI_LTL mode, iteration 1 : 314/513 places, 1481/1680 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64103 ms. Remains : 314/513 places, 1481/1680 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 343 ms.
Product exploration explored 100000 steps with 0 reset in 337 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2024-06-01 07:24:19] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:24:19] [INFO ] Invariant cache hit.
[2024-06-01 07:24:19] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/484 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 44/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/527 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/587 variables, 27/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/683 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/689 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 147/836 variables, 102/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/836 variables, 122/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/484 variables, 178/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 44/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/527 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 48/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/587 variables, 27/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 18/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 96/683 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/683 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/689 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 44 places in 406 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 4/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 147/836 variables, 102/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/836 variables, 122/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/836 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2935 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3704ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 314 transition count 1479
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 85 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 311/314 places, 1478/1481 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 511440 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 511440 steps, saw 183277 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-06-01 07:24:26] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-06-01 07:24:26] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:24:26] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 14 places in 325 ms of which 4 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 3 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 74 places in 287 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3997ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 60 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 59 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-06-01 07:24:30] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:24:30] [INFO ] Invariant cache hit.
[2024-06-01 07:24:31] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-06-01 07:24:31] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:24:31] [INFO ] Invariant cache hit.
[2024-06-01 07:24:31] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:24:33] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
[2024-06-01 07:24:33] [INFO ] Redundant transitions in 43 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-06-01 07:24:33] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:24:33] [INFO ] Invariant cache hit.
[2024-06-01 07:24:33] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 3 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:24:54] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 4 ms to minimize.
[2024-06-01 07:24:54] [INFO ] Deduced a trap composed of 61 places in 310 ms of which 5 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 68 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 65 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 40 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 4 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 4 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 56 places in 366 ms of which 4 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 40 places in 328 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 56 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 50 places in 381 ms of which 4 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 51 places in 424 ms of which 5 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 31028ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34130 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 49 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-06-01 07:25:04] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 07:25:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:25:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 07:25:04] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:25:04] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:25:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:25:04] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:25:05] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:25:05] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 279 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 61 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2024-06-01 07:25:05] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-06-01 07:25:05] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 07:25:06] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-06-01 07:25:06] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:25:06] [INFO ] Invariant cache hit.
[2024-06-01 07:25:06] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:25:08] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
[2024-06-01 07:25:08] [INFO ] Redundant transitions in 42 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-06-01 07:25:08] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:25:08] [INFO ] Invariant cache hit.
[2024-06-01 07:25:08] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 3 places in 494 ms of which 5 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 5 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 43 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 4 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 20 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 42 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 4 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 15 places in 361 ms of which 4 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 4 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 17 places in 395 ms of which 4 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 5 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 19 places in 389 ms of which 4 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 69 places in 415 ms of which 5 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 57 places in 462 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:26:09] [INFO ] Deduced a trap composed of 70 places in 317 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 63 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 41/41 constraints]
After SMT, in 61191ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 61217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64413 ms. Remains : 314/314 places, 1481/1481 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2024-06-01 07:26:10] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:26:10] [INFO ] Invariant cache hit.
[2024-06-01 07:26:10] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/484 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 44/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/527 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/587 variables, 27/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/683 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/689 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 147/836 variables, 102/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/836 variables, 122/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/484 variables, 178/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 44/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/527 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 48/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/587 variables, 27/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 18/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 96/683 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/683 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/689 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 4 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 4/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 147/836 variables, 102/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/836 variables, 122/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/836 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2837 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3580ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 314 transition count 1479
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 81 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 311/314 places, 1478/1481 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 429168 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 429168 steps, saw 162379 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-06-01 07:26:17] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-06-01 07:26:17] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 07:26:17] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 4 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 14 places in 341 ms of which 4 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 4 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 17 places in 431 ms of which 4 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 74 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 66 places in 417 ms of which 4 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3815 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4349ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 57 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 61 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-06-01 07:26:21] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:26:21] [INFO ] Invariant cache hit.
[2024-06-01 07:26:22] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 07:26:22] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:26:22] [INFO ] Invariant cache hit.
[2024-06-01 07:26:23] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:26:24] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
[2024-06-01 07:26:25] [INFO ] Redundant transitions in 44 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-06-01 07:26:25] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-06-01 07:26:25] [INFO ] Invariant cache hit.
[2024-06-01 07:26:25] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 4 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 61 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 68 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 65 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 5 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 3 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 56 places in 348 ms of which 5 ms to minimize.
SMT process timed out in 31429ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34627 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 33 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-06-01 07:26:56] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 07:26:56] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:26:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 07:26:56] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 07:26:56] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:26:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:26:56] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:26:56] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:26:56] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 329 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 35 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2024-06-01 07:26:58] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-06-01 07:26:58] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 07:26:58] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-06-01 07:26:58] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:26:58] [INFO ] Invariant cache hit.
[2024-06-01 07:26:59] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:27:01] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 3038 ms to find 0 implicit places.
[2024-06-01 07:27:01] [INFO ] Redundant transitions in 43 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-06-01 07:27:01] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-06-01 07:27:01] [INFO ] Invariant cache hit.
[2024-06-01 07:27:01] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 13 places in 355 ms of which 4 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 20 places in 294 ms of which 5 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 42 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 17 places in 482 ms of which 4 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 25 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 69 places in 424 ms of which 5 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 57 places in 486 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 62 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 40/40 constraints]
After SMT, in 61177ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 61215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64343 ms. Remains : 314/314 places, 1481/1481 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 288860 ms.
[2024-06-01 07:28:02] [INFO ] Flatten gal took : 116 ms
[2024-06-01 07:28:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 07:28:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 513 places, 1680 transitions and 8092 arcs took 40 ms.
Total runtime 842728 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLCardinality-00
BK_STOP 1717227208944
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name EisenbergMcGuire-PT-07-LTLCardinality-00
ltl formula formula --ltl=/tmp/2867/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 513 places, 1680 transitions and 8092 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.080 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2867/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2867/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2867/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2867/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 515 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 514, there are 1784 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~86860 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~156860 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~296860 transitions
pnml2lts-mc( 1/ 4): ~19924 levels ~80000 states ~564456 transitions
pnml2lts-mc( 3/ 4): ~34519 levels ~160000 states ~1128852 transitions
pnml2lts-mc( 2/ 4): ~62079 levels ~320000 states ~2256860 transitions
pnml2lts-mc( 2/ 4): ~112117 levels ~640000 states ~4496860 transitions
pnml2lts-mc( 3/ 4): ~225525 levels ~1280000 states ~8968852 transitions
pnml2lts-mc( 3/ 4): ~413831 levels ~2560000 states ~17928852 transitions
pnml2lts-mc( 3/ 4): ~761436 levels ~5120000 states ~35848852 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6864017
pnml2lts-mc( 0/ 4): unique transitions count: 48057331
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 28182179
pnml2lts-mc( 0/ 4): - claim success count: 6864662
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3756834
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6864683 states 48061996 transitions, fanout: 7.001
pnml2lts-mc( 0/ 4): Total exploration time 324.860 sec (324.830 sec minimum, 324.840 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21131, Transitions per second: 147947
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 139.7MB, 14.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1710 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 139.7MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-07"
export BK_EXAMINATION="LTLCardinality"
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 EisenbergMcGuire-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266300179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;