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.r549-tall-171734897900139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CO4-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 239K Jun 2 16:33 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 CO4-PT-18-LTLCardinality-00
FORMULA_NAME CO4-PT-18-LTLCardinality-01
FORMULA_NAME CO4-PT-18-LTLCardinality-02
FORMULA_NAME CO4-PT-18-LTLCardinality-03
FORMULA_NAME CO4-PT-18-LTLCardinality-04
FORMULA_NAME CO4-PT-18-LTLCardinality-05
FORMULA_NAME CO4-PT-18-LTLCardinality-06
FORMULA_NAME CO4-PT-18-LTLCardinality-07
FORMULA_NAME CO4-PT-18-LTLCardinality-08
FORMULA_NAME CO4-PT-18-LTLCardinality-09
FORMULA_NAME CO4-PT-18-LTLCardinality-10
FORMULA_NAME CO4-PT-18-LTLCardinality-11
FORMULA_NAME CO4-PT-18-LTLCardinality-12
FORMULA_NAME CO4-PT-18-LTLCardinality-13
FORMULA_NAME CO4-PT-18-LTLCardinality-14
FORMULA_NAME CO4-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717360310004

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:31:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:31:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:31:51] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 20:31:51] [INFO ] Transformed 979 places.
[2024-06-02 20:31:51] [INFO ] Transformed 1111 transitions.
[2024-06-02 20:31:51] [INFO ] Found NUPN structural information;
[2024-06-02 20:31:51] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 145 place count 680 transition count 801
Iterating global reduction 1 with 128 rules applied. Total rules applied 273 place count 680 transition count 801
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 376 place count 577 transition count 698
Iterating global reduction 1 with 103 rules applied. Total rules applied 479 place count 577 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 482 place count 577 transition count 695
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 528 place count 531 transition count 649
Iterating global reduction 2 with 46 rules applied. Total rules applied 574 place count 531 transition count 649
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 608 place count 497 transition count 615
Iterating global reduction 2 with 34 rules applied. Total rules applied 642 place count 497 transition count 615
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 644 place count 497 transition count 613
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 660 place count 481 transition count 597
Iterating global reduction 3 with 16 rules applied. Total rules applied 676 place count 481 transition count 597
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 481 transition count 595
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 682 place count 477 transition count 591
Iterating global reduction 4 with 4 rules applied. Total rules applied 686 place count 477 transition count 591
Applied a total of 686 rules in 216 ms. Remains 477 /822 variables (removed 345) and now considering 591/934 (removed 343) transitions.
// Phase 1: matrix 591 rows 477 cols
[2024-06-02 20:31:51] [INFO ] Computed 5 invariants in 23 ms
[2024-06-02 20:31:52] [INFO ] Implicit Places using invariants in 295 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/822 places, 591/934 transitions.
Applied a total of 0 rules in 18 ms. Remains 476 /476 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 577 ms. Remains : 476/822 places, 591/934 transitions.
Support contains 39 out of 476 places after structural reductions.
[2024-06-02 20:31:52] [INFO ] Flatten gal took : 67 ms
[2024-06-02 20:31:52] [INFO ] Flatten gal took : 31 ms
[2024-06-02 20:31:52] [INFO ] Input system was already deterministic with 591 transitions.
RANDOM walk for 40000 steps (27 resets) in 1665 ms. (24 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (18 resets) in 89 ms. (44 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 57 ms. (69 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (23 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (25 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (24 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (21 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (16 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
// Phase 1: matrix 591 rows 476 cols
[2024-06-02 20:31:53] [INFO ] Computed 4 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 107/170 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 242/412 variables, 73/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 371/783 variables, 166/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 213/996 variables, 129/435 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/996 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 51/1047 variables, 33/468 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1047 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 16/1063 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1063 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 4/1067 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1067 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/1067 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1067/1067 variables, and 480 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 107/170 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 242/412 variables, 73/141 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 18/159 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 371/783 variables, 166/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/783 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 213/996 variables, 129/454 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/996 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 51/1047 variables, 33/487 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1047 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 16/1063 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1063 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 19 (OVERLAPS) 4/1067 variables, 4/499 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1067 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 0/1067 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1067/1067 variables, and 499 constraints, problems are : Problem set: 1 solved, 18 unsolved in 3279 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5510ms problems are : Problem set: 1 solved, 18 unsolved
Parikh walk visited 15 properties in 7957 ms.
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 500 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 14 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 737 edges and 474 vertex of which 459 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 459 transition count 342
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 457 place count 241 transition count 340
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 459 place count 240 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 460 place count 239 transition count 339
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 460 place count 239 transition count 294
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 550 place count 194 transition count 294
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 554 place count 190 transition count 290
Iterating global reduction 4 with 4 rules applied. Total rules applied 558 place count 190 transition count 290
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 558 place count 190 transition count 288
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 562 place count 188 transition count 288
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 565 place count 185 transition count 285
Iterating global reduction 4 with 3 rules applied. Total rules applied 568 place count 185 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 569 place count 185 transition count 284
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 570 place count 184 transition count 283
Iterating global reduction 5 with 1 rules applied. Total rules applied 571 place count 184 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 572 place count 184 transition count 282
Performed 69 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 710 place count 115 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 717 place count 115 transition count 191
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 723 place count 109 transition count 185
Iterating global reduction 7 with 6 rules applied. Total rules applied 729 place count 109 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 730 place count 109 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 732 place count 108 transition count 183
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 790 place count 79 transition count 185
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 808 place count 79 transition count 167
Discarding 25 places :
Symmetric choice reduction at 9 with 25 rule applications. Total rules 833 place count 54 transition count 117
Iterating global reduction 9 with 25 rules applied. Total rules applied 858 place count 54 transition count 117
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 874 place count 54 transition count 101
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 880 place count 48 transition count 84
Iterating global reduction 10 with 6 rules applied. Total rules applied 886 place count 48 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 890 place count 48 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 894 place count 46 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 901 place count 46 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 12 with 18 rules applied. Total rules applied 919 place count 46 transition count 83
Free-agglomeration rule applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 925 place count 46 transition count 77
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 933 place count 40 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 934 place count 40 transition count 75
Graph (complete) has 119 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 935 place count 39 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 936 place count 39 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 937 place count 39 transition count 74
Graph (complete) has 116 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 938 place count 38 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 939 place count 38 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 940 place count 38 transition count 73
Graph (complete) has 113 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 941 place count 37 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 942 place count 37 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 943 place count 36 transition count 71
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 22 edges and 32 vertex of which 3 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 3 rules applied. Total rules applied 946 place count 30 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 951 place count 30 transition count 64
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 952 place count 29 transition count 62
Iterating global reduction 21 with 1 rules applied. Total rules applied 953 place count 29 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 954 place count 29 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 22 with 17 rules applied. Total rules applied 971 place count 29 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 973 place count 28 transition count 43
Discarding 3 places :
Symmetric choice reduction at 23 with 3 rule applications. Total rules 976 place count 25 transition count 40
Iterating global reduction 23 with 3 rules applied. Total rules applied 979 place count 25 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 982 place count 25 transition count 37
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 984 place count 23 transition count 35
Iterating global reduction 24 with 2 rules applied. Total rules applied 986 place count 23 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 987 place count 23 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 989 place count 22 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 991 place count 22 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 992 place count 22 transition count 36
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 994 place count 22 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 996 place count 20 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 997 place count 20 transition count 34
Applied a total of 997 rules in 164 ms. Remains 20 /476 variables (removed 456) and now considering 34/591 (removed 557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 20/476 places, 34/591 transitions.
RANDOM walk for 547 steps (31 resets) in 13 ms. (39 steps per ms) remains 0/3 properties
FORMULA CO4-PT-18-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 740 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 454 transition count 569
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 454 transition count 569
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 444 transition count 559
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 444 transition count 559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 444 transition count 557
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 440 transition count 553
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 440 transition count 553
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 437 transition count 550
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 78 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 20:32:07] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 20:32:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 20:32:07] [INFO ] Invariant cache hit.
[2024-06-02 20:32:07] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:32:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:32:25] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 23 ms to minimize.
[2024-06-02 20:32:25] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 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 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.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)timeout

(s117 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-04
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 3 ms.
FORMULA CO4-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-04 finished in 60920 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)))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 457 transition count 572
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 457 transition count 572
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 449 transition count 564
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 449 transition count 564
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 449 transition count 562
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 446 transition count 559
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 444 transition count 557
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 444 transition count 557
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 443 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 443 transition count 556
Applied a total of 68 rules in 60 ms. Remains 443 /476 variables (removed 33) and now considering 556/591 (removed 35) transitions.
// Phase 1: matrix 556 rows 443 cols
[2024-06-02 20:33:08] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 20:33:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 20:33:08] [INFO ] Invariant cache hit.
[2024-06-02 20:33:08] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2024-06-02 20:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/999 variables, 443/447 constraints. Problems are: Problem set: 0 solved, 555 unsolved
[2024-06-02 20:33:26] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
[2024-06-02 20:33:26] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/999 variables, and 449 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 556/999 variables, 443/449 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 555/1004 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(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 0)
(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 0)
(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 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 timeout
0)
(s353 0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/999 variables, and 1004 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 443/476 places, 556/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 443/476 places, 556/591 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 6 reset in 182 ms.
Product exploration explored 100000 steps with 43 reset in 137 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 700 edges and 443 vertex of which 438 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (114 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (74 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1446065 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :0 out of 1
Probabilistic random walk after 1446065 steps, saw 276691 distinct states, run finished after 3004 ms. (steps per millisecond=481 ) properties seen :0
[2024-06-02 20:34:12] [INFO ] Invariant cache hit.
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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/82 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 229/311 variables, 82/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 357/668 variables, 161/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/684 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 229/913 variables, 128/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/913 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/981 variables, 41/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/981 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/997 variables, 10/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/997 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/999 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/999 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 999/999 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/82 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 229/311 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 357/668 variables, 161/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/684 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 229/913 variables, 128/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/913 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/981 variables, 41/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/981 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/997 variables, 10/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/997 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/999 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/999 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 999/999 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-06 finished in 65023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p2)||p1))))'
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 460 transition count 575
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 460 transition count 575
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 453 transition count 568
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 453 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 453 transition count 567
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 449 transition count 563
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 449 transition count 563
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 446 transition count 560
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 446 transition count 560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 445 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 445 transition count 559
Applied a total of 63 rules in 50 ms. Remains 445 /476 variables (removed 31) and now considering 559/591 (removed 32) transitions.
// Phase 1: matrix 559 rows 445 cols
[2024-06-02 20:34:13] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:34:13] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 20:34:13] [INFO ] Invariant cache hit.
[2024-06-02 20:34:13] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 558 sub problems to find dead transitions.
[2024-06-02 20:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (OVERLAPS) 559/1004 variables, 445/449 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-06-02 20:34:31] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 5 ms to minimize.
[2024-06-02 20:34:31] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1004 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1004/1004 variables, and 451 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 559/1004 variables, 445/451 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1004 variables, 558/1009 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1004 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1004 variables, and 1009 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 445/476 places, 559/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60522 ms. Remains : 445/476 places, 559/591 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 706 edges and 445 vertex of which 439 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 24 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-07 finished in 61290 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||X(p1)))))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 446 transition count 561
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 46 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 20:35:14] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:35:14] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 20:35:14] [INFO ] Invariant cache hit.
[2024-06-02 20:35:14] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:35:32] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:35:32] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 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 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.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 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60506 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-09
Product exploration explored 100000 steps with 12 reset in 109 ms.
Product exploration explored 100000 steps with 5 reset in 136 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 135 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (99 resets) in 328 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (98 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (42 resets) in 291 ms. (136 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (44 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (29 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
[2024-06-02 20:36:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 201/263 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 340/603 variables, 150/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/621 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 240/861 variables, 129/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 94/955 variables, 54/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/955 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 16 (OVERLAPS) 23/978 variables, 15/435 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 1 solved, 2 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 201/263 variables, 72/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 340/603 variables, 150/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/621 variables, 4/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 3/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/861 variables, 129/368 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 94/955 variables, 54/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/955 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 23/978 variables, 15/437 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/441 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/442 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 1 solved, 2 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 931ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 359 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 18 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 20:36:17] [INFO ] Invariant cache hit.
[2024-06-02 20:36:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:36:17] [INFO ] Invariant cache hit.
[2024-06-02 20:36:18] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:36:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:36:35] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-06-02 20:36:35] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 436/436 places, 549/549 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (64 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (33 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (105 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (126 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (44 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 705098 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :2 out of 4
Probabilistic random walk after 705098 steps, saw 140637 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :2
[2024-06-02 20:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/263 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 340/603 variables, 150/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/621 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 240/861 variables, 129/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 94/955 variables, 54/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/955 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 23/978 variables, 15/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 201/263 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 340/603 variables, 150/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/621 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/861 variables, 129/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 94/955 variables, 54/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/955 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 23/978 variables, 15/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 928ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 549/549 transitions.
Graph (trivial) has 470 edges and 436 vertex of which 3 / 436 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 690 edges and 434 vertex of which 419 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 419 transition count 323
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 196 rules applied. Total rules applied 410 place count 225 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 224 transition count 321
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 411 place count 224 transition count 274
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 505 place count 177 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 506 place count 176 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 176 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 176 transition count 272
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 640 place count 110 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 645 place count 110 transition count 185
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 651 place count 104 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 657 place count 104 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 663 place count 101 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 667 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 671 place count 97 transition count 168
Iterating global reduction 6 with 4 rules applied. Total rules applied 675 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 676 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 682 place count 94 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 685 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 688 place count 91 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 691 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 693 place count 91 transition count 156
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 56 rules applied. Total rules applied 749 place count 63 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 785 place count 63 transition count 122
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 810 place count 38 transition count 86
Iterating global reduction 10 with 25 rules applied. Total rules applied 835 place count 38 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 855 place count 38 transition count 66
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 859 place count 34 transition count 55
Iterating global reduction 11 with 4 rules applied. Total rules applied 863 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 866 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 868 place count 33 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 871 place count 33 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 884 place count 33 transition count 51
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 885 place count 32 transition count 50
Iterating global reduction 13 with 1 rules applied. Total rules applied 886 place count 32 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 887 place count 32 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 892 place count 32 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 899 place count 27 transition count 42
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 901 place count 27 transition count 42
Graph (complete) has 77 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 902 place count 26 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 903 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 904 place count 26 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 905 place count 26 transition count 40
Graph (complete) has 73 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 906 place count 25 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 907 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 908 place count 25 transition count 39
Graph (complete) has 70 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 909 place count 24 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 910 place count 24 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 911 place count 23 transition count 37
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 914 place count 17 transition count 35
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t508.t44.t45.t46.t47.t48.t49.t50.t51.t63.t30.t561.t168.t169.t170.t574.t13.t173 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 9 rules applied. Total rules applied 923 place count 13 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 928 place count 12 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 930 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 931 place count 11 transition count 19
Iterating global reduction 24 with 1 rules applied. Total rules applied 932 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 933 place count 11 transition count 18
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 936 place count 11 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 939 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 941 place count 8 transition count 13
Applied a total of 941 rules in 55 ms. Remains 8 /436 variables (removed 428) and now considering 13/549 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 8/436 places, 13/549 transitions.
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 12 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 20:37:23] [INFO ] Invariant cache hit.
[2024-06-02 20:37:23] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:37:23] [INFO ] Invariant cache hit.
[2024-06-02 20:37:23] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:37:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in LTL mode , in 1 iterations and 60493 ms. Remains : 436/436 places, 549/549 transitions.
Treatment of property CO4-PT-18-LTLCardinality-09 finished in 189583 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 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 508 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 738 edges and 474 vertex of which 468 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 467 transition count 366
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 252 transition count 364
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 251 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 250 transition count 363
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 437 place count 250 transition count 317
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 529 place count 204 transition count 317
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 534 place count 199 transition count 312
Iterating global reduction 4 with 5 rules applied. Total rules applied 539 place count 199 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 539 place count 199 transition count 310
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 543 place count 197 transition count 310
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 546 place count 194 transition count 307
Iterating global reduction 4 with 3 rules applied. Total rules applied 549 place count 194 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 550 place count 194 transition count 306
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 696 place count 121 transition count 213
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 703 place count 121 transition count 206
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 709 place count 115 transition count 200
Iterating global reduction 6 with 6 rules applied. Total rules applied 715 place count 115 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 716 place count 115 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 718 place count 114 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 784 place count 81 transition count 200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 804 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 831 place count 54 transition count 126
Iterating global reduction 8 with 27 rules applied. Total rules applied 858 place count 54 transition count 126
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 875 place count 54 transition count 109
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 882 place count 47 transition count 89
Iterating global reduction 9 with 7 rules applied. Total rules applied 889 place count 47 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 894 place count 47 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 898 place count 45 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 919 place count 45 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 921 place count 43 transition count 87
Applied a total of 921 rules in 52 ms. Remains 43 /476 variables (removed 433) and now considering 87/591 (removed 504) transitions.
[2024-06-02 20:38:24] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
// Phase 1: matrix 77 rows 43 cols
[2024-06-02 20:38:24] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 20:38:24] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 20:38:24] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:24] [INFO ] Invariant cache hit.
[2024-06-02 20:38:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:38:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 20:38:24] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 20:38:24] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:24] [INFO ] Invariant cache hit.
[2024-06-02 20:38:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 50 constraints, problems are : Problem set: 0 solved, 74 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 74/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 124 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2011ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2012ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/476 places, 87/591 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2159 ms. Remains : 43/476 places, 87/591 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-10
Product exploration explored 100000 steps with 36 reset in 91 ms.
Product exploration explored 100000 steps with 10 reset in 76 ms.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 18787 steps (1985 resets) in 187 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-02 20:38:26] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:26] [INFO ] Invariant cache hit.
[2024-06-02 20:38:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 20:38:26] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:26] [INFO ] Invariant cache hit.
[2024-06-02 20:38:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:38:26] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 20:38:26] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 20:38:26] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:26] [INFO ] Invariant cache hit.
[2024-06-02 20:38:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 50 constraints, problems are : Problem set: 0 solved, 74 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 74/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 124 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2041ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2138 ms. Remains : 43/43 places, 87/87 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 24223 steps (2570 resets) in 53 ms. (448 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9 reset in 41 ms.
Product exploration explored 100000 steps with 9 reset in 51 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 87/87 transitions.
Applied a total of 0 rules in 15 ms. Remains 43 /43 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-02 20:38:29] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:29] [INFO ] Invariant cache hit.
[2024-06-02 20:38:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 20:38:29] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:29] [INFO ] Invariant cache hit.
[2024-06-02 20:38:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:38:29] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-06-02 20:38:29] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 20:38:29] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 20:38:29] [INFO ] Invariant cache hit.
[2024-06-02 20:38:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 50 constraints, problems are : Problem set: 0 solved, 74 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 74/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 124 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2100ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2252 ms. Remains : 43/43 places, 87/87 transitions.
Treatment of property CO4-PT-18-LTLCardinality-10 finished in 7675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 455 transition count 570
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 455 transition count 570
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 446 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 28 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 20:38:31] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 20:38:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 20:38:31] [INFO ] Invariant cache hit.
[2024-06-02 20:38:32] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:38:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:38:49] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-02 20:38:49] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Product exploration explored 100000 steps with 25000 reset in 127 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 695 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (159 resets) in 153 ms. (259 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (102 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (100 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-06-02 20:39:33] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/81 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/237 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 346/583 variables, 147/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 287/870 variables, 151/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/870 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/954 variables, 54/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/954 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/976 variables, 11/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/976 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/985 variables, 7/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/81 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/237 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 346/583 variables, 147/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 287/870 variables, 151/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/870 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/954 variables, 54/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/954 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 22/976 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/976 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 18 (OVERLAPS) 9/985 variables, 7/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 1 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-11 finished in 62283 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&&X(p1)) U p2)&&(p1 U p3)))))'
Support contains 7 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 458 transition count 573
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 458 transition count 573
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 450 transition count 565
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 450 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 450 transition count 564
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 446 transition count 560
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 446 transition count 560
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 443 transition count 557
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 443 transition count 557
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 442 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 442 transition count 556
Applied a total of 69 rules in 34 ms. Remains 442 /476 variables (removed 34) and now considering 556/591 (removed 35) transitions.
// Phase 1: matrix 556 rows 442 cols
[2024-06-02 20:39:34] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:39:34] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-02 20:39:34] [INFO ] Invariant cache hit.
[2024-06-02 20:39:34] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2024-06-02 20:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/998 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 555 unsolved
[2024-06-02 20:39:52] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-02 20:39:52] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/998 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 998/998 variables, and 448 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 556/998 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/998 variables, 555/1003 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/998 variables, and 1003 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 556/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60848 ms. Remains : 442/476 places, 556/591 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-12
Product exploration explored 100000 steps with 50 reset in 118 ms.
Product exploration explored 100000 steps with 2 reset in 119 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 700 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X p0), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p0)), (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 205 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
RANDOM walk for 40000 steps (137 resets) in 543 ms. (73 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40001 steps (135 resets) in 120 ms. (330 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (68 resets) in 407 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (46 resets) in 766 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (42 resets) in 416 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (181 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (45 resets) in 385 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (49 resets) in 340 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (100 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (91 resets) in 391 ms. (102 steps per ms) remains 9/9 properties
[2024-06-02 20:40:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 55/78 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 197/275 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 17/292 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 10/302 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 390/692 variables, 190/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 225/917 variables, 131/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/917 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 69/986 variables, 46/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/986 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 10/996 variables, 6/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/996 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/998 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/998 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/998 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 446 constraints, problems are : Problem set: 0 solved, 9 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 55/78 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 197/275 variables, 42/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 17/292 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/302 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 390/692 variables, 190/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 225/917 variables, 131/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/917 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 69/986 variables, 46/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/986 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf9 is UNSAT
At refinement iteration 19 (OVERLAPS) 10/996 variables, 6/453 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/996 variables, 0/453 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 2/998 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/998 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/998 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 455 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2541ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1704 steps, including 18 resets, run visited all 8 properties in 23 ms. (steps per millisecond=74 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 24 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X p0), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p0)), (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)))), (X (X p1)), (G (OR p3 p1))]
False Knowledge obtained : [(F (NOT (AND (OR p2 (NOT p3) (NOT p0)) (OR p2 (NOT p1) (NOT p0))))), (F (NOT (OR (AND p2 p3) (AND p2 p1) (AND p3 p0) (AND p1 p0)))), (F (NOT (OR p3 (NOT p1)))), (F (NOT (AND (OR p2 p0) p1))), (F (NOT (AND (OR (NOT p2) p3 (NOT p1)) (OR p3 (NOT p1) (NOT p0))))), (F (NOT (AND (OR p2 p0) (OR p3 p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND p2 p3) (AND p2 p1) (AND p3 p0) (AND p1 p0))))
Knowledge based reduction with 22 factoid took 214 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-12 finished in 66169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 446 transition count 561
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 41 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 20:40:40] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 20:40:40] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 20:40:40] [INFO ] Invariant cache hit.
[2024-06-02 20:40:40] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:40:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:40:57] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:40:57] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60555 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLCardinality-13
Product exploration explored 100000 steps with 33365 reset in 127 ms.
Product exploration explored 100000 steps with 33447 reset in 125 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (48 resets) in 323 ms. (123 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (41 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (61 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
[2024-06-02 20:41:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/315 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/333 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/666 variables, 170/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 207/873 variables, 105/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 83/956 variables, 47/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/956 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 17 (OVERLAPS) 22/978 variables, 14/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 1 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/49 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/218 variables, 67/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 251/469 variables, 102/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/488 variables, 4/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/732 variables, 124/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/732 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 166/898 variables, 81/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/966 variables, 42/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/966 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/979 variables, 8/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/979 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/984 variables, 3/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/984 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/985 variables, 1/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/985 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/985 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 441 constraints, problems are : Problem set: 1 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 642ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 173 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 5 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 20:41:42] [INFO ] Invariant cache hit.
[2024-06-02 20:41:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 20:41:42] [INFO ] Invariant cache hit.
[2024-06-02 20:41:43] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:41:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-06-02 20:42:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in LTL mode , in 1 iterations and 60600 ms. Remains : 436/436 places, 549/549 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (97 resets) in 337 ms. (118 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (66 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (145 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2024-06-02 20:42:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/315 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/333 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/666 variables, 170/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 207/873 variables, 105/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 83/956 variables, 47/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/956 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/978 variables, 14/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 227/304 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/315 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/333 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 333/666 variables, 170/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 207/873 variables, 105/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/873 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 83/956 variables, 47/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/956 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 22/978 variables, 14/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/978 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/984 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/984 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/985 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 252 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 82 ms.
Product exploration explored 100000 steps with 1 reset in 80 ms.
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 12 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 20:42:45] [INFO ] Invariant cache hit.
[2024-06-02 20:42:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 20:42:45] [INFO ] Invariant cache hit.
[2024-06-02 20:42:45] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 20:42:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 20:43:02] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2024-06-02 20:43:02] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in LTL mode , in 1 iterations and 60465 ms. Remains : 436/436 places, 549/549 transitions.
Treatment of property CO4-PT-18-LTLCardinality-13 finished in 185914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X((p1 U p2))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 448 transition count 563
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 448 transition count 563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 448 transition count 561
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 445 transition count 558
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 445 transition count 558
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 442 transition count 555
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 442 transition count 555
Applied a total of 70 rules in 25 ms. Remains 442 /476 variables (removed 34) and now considering 555/591 (removed 36) transitions.
// Phase 1: matrix 555 rows 442 cols
[2024-06-02 20:43:46] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:43:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:43:46] [INFO ] Invariant cache hit.
[2024-06-02 20:43:46] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2024-06-02 20:43:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (OVERLAPS) 555/997 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 554 unsolved
[2024-06-02 20:44:04] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-02 20:44:04] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/997 variables, and 448 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 555/997 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 554/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1002 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 555/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 442/476 places, 555/591 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 699 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 30 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-14 finished in 61143 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||X(p1)))))'
Found a Lengthening insensitive property : CO4-PT-18-LTLCardinality-09
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 509 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 738 edges and 474 vertex of which 468 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 467 transition count 363
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 249 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 441 place count 248 transition count 361
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 441 place count 248 transition count 315
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 533 place count 202 transition count 315
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 537 place count 198 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 541 place count 198 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 541 place count 198 transition count 309
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 545 place count 196 transition count 309
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 548 place count 193 transition count 306
Iterating global reduction 3 with 3 rules applied. Total rules applied 551 place count 193 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 552 place count 193 transition count 305
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 698 place count 120 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 704 place count 120 transition count 206
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 709 place count 115 transition count 201
Iterating global reduction 5 with 5 rules applied. Total rules applied 714 place count 115 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 716 place count 114 transition count 200
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 782 place count 81 transition count 202
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 803 place count 81 transition count 181
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 831 place count 53 transition count 125
Iterating global reduction 6 with 28 rules applied. Total rules applied 859 place count 53 transition count 125
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 878 place count 53 transition count 106
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 885 place count 46 transition count 86
Iterating global reduction 7 with 7 rules applied. Total rules applied 892 place count 46 transition count 86
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 897 place count 46 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 45 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 902 place count 45 transition count 87
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 903 place count 45 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 904 place count 45 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 906 place count 43 transition count 84
Applied a total of 906 rules in 38 ms. Remains 43 /476 variables (removed 433) and now considering 84/591 (removed 507) transitions.
[2024-06-02 20:44:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
// Phase 1: matrix 79 rows 43 cols
[2024-06-02 20:44:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:44:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:44:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:47] [INFO ] Invariant cache hit.
[2024-06-02 20:44:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:47] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-02 20:44:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:47] [INFO ] Invariant cache hit.
[2024-06-02 20:44:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 119 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2109ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2110ms
Starting structural reductions in LI_LTL mode, iteration 1 : 43/476 places, 84/591 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2287 ms. Remains : 43/476 places, 84/591 transitions.
Running random walk in product with property : CO4-PT-18-LTLCardinality-09
Product exploration explored 100000 steps with 47 reset in 54 ms.
Product exploration explored 100000 steps with 2 reset in 55 ms.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 179 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4272 resets) in 157 ms. (253 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (517 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 20:44:50] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:50] [INFO ] Invariant cache hit.
[2024-06-02 20:44:50] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/51 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 102/122 variables, and 31 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 31/43 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 320 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-02 20:44:50] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:50] [INFO ] Invariant cache hit.
[2024-06-02 20:44:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 20:44:50] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:50] [INFO ] Invariant cache hit.
[2024-06-02 20:44:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-02 20:44:50] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:50] [INFO ] Invariant cache hit.
[2024-06-02 20:44:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 70 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 119 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1935ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1937ms
Finished structural reductions in LTL mode , in 1 iterations and 2033 ms. Remains : 43/43 places, 84/84 transitions.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 31330 steps (3348 resets) in 45 ms. (681 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 204 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 38 ms.
Product exploration explored 100000 steps with 13 reset in 40 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-02 20:44:53] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:53] [INFO ] Invariant cache hit.
[2024-06-02 20:44:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 20:44:53] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:53] [INFO ] Invariant cache hit.
[2024-06-02 20:44:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:53] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-02 20:44:53] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 20:44:53] [INFO ] Invariant cache hit.
[2024-06-02 20:44:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 70 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 119 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1967ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1969ms
Finished structural reductions in LTL mode , in 1 iterations and 2074 ms. Remains : 43/43 places, 84/84 transitions.
Treatment of property CO4-PT-18-LTLCardinality-09 finished in 8344 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Found a Lengthening insensitive property : CO4-PT-18-LTLCardinality-13
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 507 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 738 edges and 474 vertex of which 468 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 467 transition count 365
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 251 transition count 363
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 438 place count 250 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 439 place count 249 transition count 362
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 439 place count 249 transition count 316
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 531 place count 203 transition count 316
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 536 place count 198 transition count 311
Iterating global reduction 4 with 5 rules applied. Total rules applied 541 place count 198 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 541 place count 198 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 545 place count 196 transition count 309
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 548 place count 193 transition count 306
Iterating global reduction 4 with 3 rules applied. Total rules applied 551 place count 193 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 552 place count 193 transition count 305
Performed 71 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 694 place count 122 transition count 220
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 705 place count 122 transition count 209
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 710 place count 117 transition count 204
Iterating global reduction 6 with 5 rules applied. Total rules applied 715 place count 117 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 717 place count 116 transition count 203
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 783 place count 83 transition count 205
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 803 place count 83 transition count 185
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 830 place count 56 transition count 131
Iterating global reduction 7 with 27 rules applied. Total rules applied 857 place count 56 transition count 131
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 874 place count 56 transition count 114
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 881 place count 49 transition count 94
Iterating global reduction 8 with 7 rules applied. Total rules applied 888 place count 49 transition count 94
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 893 place count 49 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 895 place count 48 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 898 place count 48 transition count 97
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 908 place count 48 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 910 place count 46 transition count 95
Applied a total of 910 rules in 39 ms. Remains 46 /476 variables (removed 430) and now considering 95/591 (removed 496) transitions.
[2024-06-02 20:44:56] [INFO ] Flow matrix only has 90 transitions (discarded 5 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-06-02 20:44:56] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:44:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 20:44:56] [INFO ] Flow matrix only has 90 transitions (discarded 5 similar events)
[2024-06-02 20:44:56] [INFO ] Invariant cache hit.
[2024-06-02 20:44:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:44:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-06-02 20:44:56] [INFO ] Flow matrix only has 90 transitions (discarded 5 similar events)
[2024-06-02 20:44:56] [INFO ] Invariant cache hit.
[2024-06-02 20:44:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 89/135 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/136 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 52 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 89/135 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 81/132 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 133 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 2371ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 2372ms
Starting structural reductions in LI_LTL mode, iteration 1 : 46/476 places, 95/591 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2505 ms. Remains : 46/476 places, 95/591 transitions.
Running random walk in product with property : CO4-PT-18-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2908 steps with 957 reset in 11 ms.
Treatment of property CO4-PT-18-LTLCardinality-13 finished in 2765 ms.
FORMULA CO4-PT-18-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 20:44:58] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:44:58] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 20:44:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 476 places, 591 transitions and 1324 arcs took 6 ms.
Total runtime 787363 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 476
TRANSITIONS: 591
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1688
MODEL NAME: /home/mcc/execution/411/model
476 places, 591 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
FORMULA CO4-PT-18-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-18-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-18-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717361487666

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

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

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="CO4-PT-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-18, 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 r549-tall-171734897900139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-18.tgz
mv CO4-PT-18 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;