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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 13 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 03:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 173K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717239026717

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:50:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:50:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:50:29] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-06-01 10:50:29] [INFO ] Transformed 330 places.
[2024-06-01 10:50:29] [INFO ] Transformed 296 transitions.
[2024-06-01 10:50:29] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Support contains 59 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 316 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 21 place count 309 transition count 289
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 309 transition count 289
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 303 transition count 283
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 303 transition count 283
Applied a total of 40 rules in 226 ms. Remains 303 /330 variables (removed 27) and now considering 283/296 (removed 13) transitions.
// Phase 1: matrix 283 rows 303 cols
[2024-06-01 10:50:30] [INFO ] Computed 20 invariants in 55 ms
[2024-06-01 10:50:31] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-06-01 10:50:31] [INFO ] Invariant cache hit.
[2024-06-01 10:50:32] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-01 10:50:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 16/303 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 10:50:41] [INFO ] Deduced a trap composed of 111 places in 234 ms of which 48 ms to minimize.
[2024-06-01 10:50:42] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 283/586 variables, 303/325 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/586 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 325 constraints, problems are : Problem set: 0 solved, 268 unsolved in 28831 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 16/303 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 283/586 variables, 303/325 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 268/593 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 10:51:21] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 8 ms to minimize.
[2024-06-01 10:51:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 10:51:24] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-06-01 10:51:25] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-06-01 10:51:26] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-06-01 10:51:27] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 5 ms to minimize.
[2024-06-01 10:51:27] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 6 ms to minimize.
[2024-06-01 10:51:28] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 4 ms to minimize.
[2024-06-01 10:51:28] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 5 ms to minimize.
[2024-06-01 10:51:31] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 603 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 12/12 constraints]
After SMT, in 59216ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 59250ms
Starting structural reductions in LTL mode, iteration 1 : 303/330 places, 283/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61368 ms. Remains : 303/330 places, 283/296 transitions.
Support contains 59 out of 303 places after structural reductions.
[2024-06-01 10:51:32] [INFO ] Flatten gal took : 109 ms
[2024-06-01 10:51:32] [INFO ] Flatten gal took : 51 ms
[2024-06-01 10:51:32] [INFO ] Input system was already deterministic with 283 transitions.
RANDOM walk for 40000 steps (133 resets) in 3042 ms. (13 steps per ms) remains 17/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
[2024-06-01 10:51:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 206/228 variables, 12/12 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/252 variables, 5/17 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17/269 variables, 3/20 constraints. Problems are: Problem set: 12 solved, 5 unsolved
[2024-06-01 10:51:34] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 4 ms to minimize.
[2024-06-01 10:51:34] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 5 ms to minimize.
[2024-06-01 10:51:34] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 4 ms to minimize.
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 3/23 constraints. Problems are: Problem set: 14 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/23 constraints. Problems are: Problem set: 14 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 283/552 variables, 269/292 constraints. Problems are: Problem set: 14 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/292 constraints. Problems are: Problem set: 14 solved, 3 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/586 variables, 34/326 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/326 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/586 variables, 0/326 constraints. Problems are: Problem set: 15 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 326 constraints, problems are : Problem set: 15 solved, 2 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 15 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 187/193 variables, 5/5 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/251 variables, 12/17 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/268 variables, 3/20 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 3/23 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 283/551 variables, 268/291 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 1/292 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/292 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 35/586 variables, 35/327 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 1/328 constraints. Problems are: Problem set: 15 solved, 2 unsolved
[2024-06-01 10:51:35] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-01 10:51:35] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 2/330 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/330 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/586 variables, 0/330 constraints. Problems are: Problem set: 15 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 330 constraints, problems are : Problem set: 15 solved, 2 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 5/5 constraints]
After SMT, in 2165ms problems are : Problem set: 15 solved, 2 unsolved
Parikh walk visited 0 properties in 634 ms.
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 298 transition count 171
Reduce places removed 108 places and 0 transitions.
Graph (complete) has 322 edges and 190 vertex of which 163 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 112 rules applied. Total rules applied 225 place count 163 transition count 168
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 255 place count 160 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 258 place count 157 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 261 place count 157 transition count 138
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 3 with 1 rules applied. Total rules applied 262 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 268 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 264 place count 154 transition count 137
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 266 place count 154 transition count 135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 267 place count 153 transition count 134
Iterating global reduction 6 with 1 rules applied. Total rules applied 268 place count 153 transition count 134
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 281 place count 153 transition count 121
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 294 place count 140 transition count 121
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 308 place count 126 transition count 107
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 17 rules applied. Total rules applied 325 place count 123 transition count 93
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 339 place count 109 transition count 93
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 7 Pre rules applied. Total rules applied 339 place count 109 transition count 86
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 353 place count 102 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 357 place count 100 transition count 84
Applied a total of 357 rules in 115 ms. Remains 100 /303 variables (removed 203) and now considering 84/283 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 100/303 places, 84/283 transitions.
RANDOM walk for 40000 steps (456 resets) in 373 ms. (106 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (180 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
// Phase 1: matrix 84 rows 100 cols
[2024-06-01 10:51:36] [INFO ] Computed 16 invariants in 2 ms
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) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/72 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/97 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/180 variables, 97/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/183 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/184 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 100/100 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) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/72 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/97 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/180 variables, 97/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/183 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 18 ms.
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 303 stabilizing places and 283 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 303 transition count 283
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 18 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-06-01 10:51:37] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 10:51:37] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 10:51:37] [INFO ] Invariant cache hit.
[2024-06-01 10:51:38] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-01 10:51:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 22459 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 52619ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 52628ms
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53833 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-00
Stuttering criterion allowed to conclude after 336 steps with 1 reset in 9 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-00 finished in 54281 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 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 287 transition count 146
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 165 transition count 146
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 156 transition count 137
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 156 transition count 137
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 2 with 1 rules applied. Total rules applied 264 place count 156 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 155 transition count 136
Applied a total of 265 rules in 30 ms. Remains 155 /303 variables (removed 148) and now considering 136/283 (removed 147) transitions.
// Phase 1: matrix 136 rows 155 cols
[2024-06-01 10:52:31] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 10:52:32] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 10:52:32] [INFO ] Invariant cache hit.
[2024-06-01 10:52:32] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-06-01 10:52:32] [INFO ] Redundant transitions in 7 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 10:52:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 109/237 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/291 variables, and 147 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5002 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 109/237 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 107/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/291 variables, and 254 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5383 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 10411ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10414ms
Starting structural reductions in SI_LTL mode, iteration 1 : 155/303 places, 136/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11150 ms. Remains : 155/303 places, 136/283 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-01
Product exploration explored 100000 steps with 663 reset in 345 ms.
Product exploration explored 100000 steps with 664 reset in 342 ms.
Computed a total of 155 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 39 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-01 finished in 12099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((p1&&G(p2))))))'
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 295 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 295 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 289 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 289 transition count 270
Applied a total of 27 rules in 34 ms. Remains 289 /303 variables (removed 14) and now considering 270/283 (removed 13) transitions.
// Phase 1: matrix 270 rows 289 cols
[2024-06-01 10:52:43] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 10:52:44] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-01 10:52:44] [INFO ] Invariant cache hit.
[2024-06-01 10:52:45] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-06-01 10:52:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 15/289 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 270/559 variables, 289/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 308 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22979 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 15/289 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 270/559 variables, 289/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 255/563 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 563 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
After SMT, in 53095ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 53101ms
Starting structural reductions in LTL mode, iteration 1 : 289/303 places, 270/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54457 ms. Remains : 289/303 places, 270/283 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-03
Product exploration explored 100000 steps with 339 reset in 387 ms.
Product exploration explored 100000 steps with 338 reset in 296 ms.
Computed a total of 289 stabilizing places and 270 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 270
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p2), (X p0), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 202 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-03 finished in 55763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p0))))'
Support contains 0 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 288 transition count 155
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 174 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 173 transition count 154
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 240 place count 164 transition count 145
Iterating global reduction 3 with 9 rules applied. Total rules applied 249 place count 164 transition count 145
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 3 with 1 rules applied. Total rules applied 250 place count 164 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 163 transition count 144
Applied a total of 251 rules in 34 ms. Remains 163 /303 variables (removed 140) and now considering 144/283 (removed 139) transitions.
// Phase 1: matrix 144 rows 163 cols
[2024-06-01 10:53:39] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 10:53:39] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 10:53:39] [INFO ] Invariant cache hit.
[2024-06-01 10:53:40] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2024-06-01 10:53:40] [INFO ] Redundant transitions in 4 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 10:53:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 3/140 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 121/261 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/307 variables, and 159 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6080 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 140/163 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 3/140 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 121/261 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 118/277 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/307 variables, and 277 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5953 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 140/163 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 12054ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 12055ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/303 places, 144/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12860 ms. Remains : 163/303 places, 144/283 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 19 ms :[false]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-05
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-05 TRUE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-05 finished in 12903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p1)||(G(p2) U X(p3))))))'
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 14 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-06-01 10:53:52] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 10:53:52] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 10:53:52] [INFO ] Invariant cache hit.
[2024-06-01 10:53:53] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-01 10:53:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 14840 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 44920ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 44924ms
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45839 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-06
Product exploration explored 100000 steps with 1272 reset in 312 ms.
Product exploration explored 100000 steps with 1212 reset in 387 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1431 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 645 steps (0 resets) in 9 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 1700 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:54:43] [INFO ] Invariant cache hit.
[2024-06-01 10:54:43] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 34 ms returned sat
[2024-06-01 10:54:44] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2024-06-01 10:54:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:54:44] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 35 ms returned sat
[2024-06-01 10:54:44] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-01 10:54:45] [INFO ] Computed and/alt/rep : 177/605/177 causal constraints (skipped 76 transitions) in 97 ms.
[2024-06-01 10:54:46] [INFO ] Added : 97 causal constraints over 20 iterations in 1158 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 287 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 268/268 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 272 transition count 145
Reduce places removed 108 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 112 rules applied. Total rules applied 220 place count 164 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 224 place count 160 transition count 141
Applied a total of 224 rules in 14 ms. Remains 160 /287 variables (removed 127) and now considering 141/268 (removed 127) transitions.
// Phase 1: matrix 141 rows 160 cols
[2024-06-01 10:54:46] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 10:54:46] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 10:54:46] [INFO ] Invariant cache hit.
[2024-06-01 10:54:46] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-06-01 10:54:46] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 10:54:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 2/133 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 116/249 variables, 133/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 2/251 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/301 variables, and 154 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4700 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/160 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 2/133 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 116/249 variables, 133/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 112/264 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 2/251 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/251 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/301 variables, and 266 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6245 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/160 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 10973ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10975ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/287 places, 141/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11524 ms. Remains : 160/287 places, 141/268 transitions.
Computed a total of 160 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 160 transition count 141
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 339 steps (0 resets) in 5 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:54:58] [INFO ] Invariant cache hit.
[2024-06-01 10:54:58] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 22 ms returned sat
[2024-06-01 10:54:58] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2024-06-01 10:54:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:54:58] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 24 ms returned sat
[2024-06-01 10:54:59] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-01 10:54:59] [INFO ] Computed and/alt/rep : 112/117/112 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 10:54:59] [INFO ] Added : 50 causal constraints over 10 iterations in 135 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1267 reset in 239 ms.
Product exploration explored 100000 steps with 1264 reset in 355 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 141/141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 160 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 156 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 155 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 155 transition count 136
Applied a total of 10 rules in 20 ms. Remains 155 /160 variables (removed 5) and now considering 136/141 (removed 5) transitions.
// Phase 1: matrix 136 rows 155 cols
[2024-06-01 10:54:59] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 10:55:00] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 10:55:00] [INFO ] Invariant cache hit.
[2024-06-01 10:55:00] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-06-01 10:55:00] [INFO ] Redundant transitions in 21 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 10:55:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 109/237 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/291 variables, and 147 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3435 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 109/237 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 107/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/291 variables, and 254 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3446 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6922ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 155/160 places, 136/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7696 ms. Remains : 155/160 places, 136/141 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-06 finished in 75244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U (p0 U p1))||p2))&&!(p0 U p3)))'
Support contains 7 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 274
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 286 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 286 transition count 266
Applied a total of 34 rules in 31 ms. Remains 286 /303 variables (removed 17) and now considering 266/283 (removed 17) transitions.
// Phase 1: matrix 266 rows 286 cols
[2024-06-01 10:55:07] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 10:55:08] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 10:55:08] [INFO ] Invariant cache hit.
[2024-06-01 10:55:09] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 10:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 16/286 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 10:55:13] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 3 ms to minimize.
[2024-06-01 10:55:14] [INFO ] Deduced a trap composed of 111 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 266/552 variables, 286/308 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 308 constraints, problems are : Problem set: 0 solved, 251 unsolved in 16826 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 16/286 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 266/552 variables, 286/308 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 251/559 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 10:55:37] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-06-01 10:55:37] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-06-01 10:55:38] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2024-06-01 10:55:38] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-06-01 10:55:38] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:55:40] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 3 ms to minimize.
[2024-06-01 10:55:41] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:55:41] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 10:55:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:55:42] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:55:42] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 3 ms to minimize.
[2024-06-01 10:55:45] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
[2024-06-01 10:55:46] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2024-06-01 10:55:46] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 10:55:46] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 15/574 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 574 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 17/17 constraints]
After SMT, in 46917ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 46920ms
Starting structural reductions in LTL mode, iteration 1 : 286/303 places, 266/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48299 ms. Remains : 286/303 places, 266/283 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR p3 (AND p1 (NOT p2))), true, p3, (AND p1 (NOT p2)), p1]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 127 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-07 finished in 48625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(((p1 U p0)||F(!p1))))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 288 transition count 148
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 167 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 252 place count 158 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 261 place count 158 transition count 139
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 2 with 1 rules applied. Total rules applied 262 place count 158 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 263 place count 157 transition count 138
Applied a total of 263 rules in 19 ms. Remains 157 /303 variables (removed 146) and now considering 138/283 (removed 145) transitions.
// Phase 1: matrix 138 rows 157 cols
[2024-06-01 10:55:56] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 10:55:56] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 10:55:56] [INFO ] Invariant cache hit.
[2024-06-01 10:55:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:55:56] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-06-01 10:55:56] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 10:55:56] [INFO ] Invariant cache hit.
[2024-06-01 10:55:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 3/134 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 115/249 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/295 variables, and 159 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3858 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/157 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 3/134 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 115/249 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 112/271 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/295 variables, and 271 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4314 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/157 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 8201ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/303 places, 138/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8757 ms. Remains : 157/303 places, 138/283 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-08
Product exploration explored 100000 steps with 876 reset in 272 ms.
Product exploration explored 100000 steps with 887 reset in 300 ms.
Computed a total of 157 stabilizing places and 138 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 138
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-08 finished in 9714 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((X(p0)&&(p0||F(p1)))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 293 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 293 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 285 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 285 transition count 266
Applied a total of 35 rules in 13 ms. Remains 285 /303 variables (removed 18) and now considering 266/283 (removed 17) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-06-01 10:56:06] [INFO ] Computed 19 invariants in 18 ms
[2024-06-01 10:56:06] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 10:56:06] [INFO ] Invariant cache hit.
[2024-06-01 10:56:07] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 10:56:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 14334 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 44429ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 44432ms
Starting structural reductions in LTL mode, iteration 1 : 285/303 places, 266/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45359 ms. Remains : 285/303 places, 266/283 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 32 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-10 finished in 46311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 293 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 293 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 286 transition count 267
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 286 transition count 267
Applied a total of 33 rules in 15 ms. Remains 286 /303 variables (removed 17) and now considering 267/283 (removed 16) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-06-01 10:56:52] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 10:56:52] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 10:56:52] [INFO ] Invariant cache hit.
[2024-06-01 10:56:53] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-01 10:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 15901 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 45978ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 45981ms
Starting structural reductions in LTL mode, iteration 1 : 286/303 places, 267/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47012 ms. Remains : 286/303 places, 267/283 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-11
Product exploration explored 100000 steps with 1802 reset in 435 ms.
Product exploration explored 100000 steps with 1774 reset in 360 ms.
Computed a total of 286 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 267
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 197 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:57:41] [INFO ] Invariant cache hit.
[2024-06-01 10:57:41] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 59 ms returned sat
[2024-06-01 10:57:42] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2024-06-01 10:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:57:42] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 46 ms returned sat
[2024-06-01 10:57:43] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2024-06-01 10:57:43] [INFO ] Computed and/alt/rep : 176/605/176 causal constraints (skipped 76 transitions) in 35 ms.
[2024-06-01 10:57:44] [INFO ] Added : 60 causal constraints over 12 iterations in 774 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 267/267 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 271 transition count 138
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 157 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 156 transition count 137
Applied a total of 230 rules in 24 ms. Remains 156 /286 variables (removed 130) and now considering 137/267 (removed 130) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-06-01 10:57:44] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 10:57:44] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 10:57:44] [INFO ] Invariant cache hit.
[2024-06-01 10:57:45] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-06-01 10:57:45] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 10:57:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/293 variables, and 149 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5967 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/241 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/293 variables, and 257 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6026 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12016ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12018ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/286 places, 137/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12881 ms. Remains : 156/286 places, 137/267 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 145 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:57:58] [INFO ] Invariant cache hit.
[2024-06-01 10:57:58] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 35 ms returned sat
[2024-06-01 10:57:58] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-06-01 10:57:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:57:58] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 34 ms returned sat
[2024-06-01 10:57:59] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-06-01 10:57:59] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 10:57:59] [INFO ] Added : 58 causal constraints over 12 iterations in 294 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3268 reset in 318 ms.
Product exploration explored 100000 steps with 3279 reset in 313 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 10:58:00] [INFO ] Invariant cache hit.
[2024-06-01 10:58:00] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 10:58:00] [INFO ] Invariant cache hit.
[2024-06-01 10:58:00] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-06-01 10:58:00] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 10:58:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/293 variables, and 149 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5696 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/241 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/293 variables, and 257 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6789 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12503ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13058 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-11 finished in 80891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||((F(p2) U G(F(p2)))&&X((p0 U (p1||G(p0))))))))))'
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 15 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-06-01 10:58:13] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 10:58:13] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 10:58:13] [INFO ] Invariant cache hit.
[2024-06-01 10:58:14] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-01 10:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 21705 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 51798ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 51802ms
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52811 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-12
Product exploration explored 100000 steps with 363 reset in 241 ms.
Product exploration explored 100000 steps with 364 reset in 212 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 436 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 24 states, 70 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1344 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (132 resets) in 602 ms. (66 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (20 resets) in 328 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 532 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (18 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (16 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
[2024-06-01 10:59:09] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 229/234 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/259 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf4 is UNSAT
At refinement iteration 5 (OVERLAPS) 268/527 variables, 259/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/555 variables, 28/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 3 solved, 1 unsolved in 293 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 229/234 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/259 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf8 is UNSAT
After SMT solving in domain Int declared 527/555 variables, and 278 constraints, problems are : Problem set: 4 solved, 0 unsolved in 256 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 259/287 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR (NOT p2) p0 p1)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 12 factoid took 3234 ms. Reduced automaton from 24 states, 70 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1028 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Stuttering acceptance computed with spot in 1011 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 268/268 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 272 transition count 141
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 160 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 159 transition count 140
Applied a total of 226 rules in 22 ms. Remains 159 /287 variables (removed 128) and now considering 140/268 (removed 128) transitions.
// Phase 1: matrix 140 rows 159 cols
[2024-06-01 10:59:15] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 10:59:15] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-01 10:59:15] [INFO ] Invariant cache hit.
[2024-06-01 10:59:16] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-06-01 10:59:16] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 10:59:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6153 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7805 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 13990ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 13992ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/287 places, 140/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14839 ms. Remains : 159/287 places, 140/268 transitions.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 429 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (248 resets) in 1365 ms. (29 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
[2024-06-01 10:59:32] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf13 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/244 variables, 131/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/299 variables, and 151 constraints, problems are : Problem set: 3 solved, 1 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/159 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Int declared 244/299 variables, and 150 constraints, problems are : Problem set: 4 solved, 0 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/159 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 36 factoid took 1450 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1017 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 1120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 1011 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Product exploration explored 100000 steps with 810 reset in 392 ms.
Product exploration explored 100000 steps with 805 reset in 389 ms.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-01 10:59:38] [INFO ] Invariant cache hit.
[2024-06-01 10:59:38] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 10:59:38] [INFO ] Invariant cache hit.
[2024-06-01 10:59:39] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-01 10:59:39] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 10:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6672 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7304 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 14000ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 14002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14589 ms. Remains : 159/159 places, 140/140 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 100023 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(p0)))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 20 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-06-01 10:59:53] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 10:59:53] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 10:59:53] [INFO ] Invariant cache hit.
[2024-06-01 10:59:54] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-01 10:59:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 20630 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 50757ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 50765ms
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51998 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 344 ms.
Product exploration explored 100000 steps with 33333 reset in 353 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-13 finished in 52984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p1)||(G(p2) U X(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-15-LTLCardinality-11
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 287 transition count 147
Reduce places removed 121 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 166 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 165 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 253 place count 157 transition count 138
Iterating global reduction 3 with 8 rules applied. Total rules applied 261 place count 157 transition count 138
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 3 with 1 rules applied. Total rules applied 262 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 156 transition count 137
Applied a total of 263 rules in 18 ms. Remains 156 /303 variables (removed 147) and now considering 137/283 (removed 146) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-06-01 11:00:46] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:00:47] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 11:00:47] [INFO ] Invariant cache hit.
[2024-06-01 11:00:47] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 11:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/293 variables, and 149 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5425 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/241 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/293 variables, and 257 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5279 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10717ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10719ms
Starting structural reductions in LI_LTL mode, iteration 1 : 156/303 places, 137/283 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11309 ms. Remains : 156/303 places, 137/283 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-11
Product exploration explored 100000 steps with 3260 reset in 488 ms.
Product exploration explored 100000 steps with 3283 reset in 320 ms.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 145 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:00:59] [INFO ] Invariant cache hit.
[2024-06-01 11:00:59] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 32 ms returned sat
[2024-06-01 11:01:00] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-06-01 11:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:00] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 25 ms returned sat
[2024-06-01 11:01:00] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-06-01 11:01:00] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 11:01:00] [INFO ] Added : 21 causal constraints over 5 iterations in 130 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:01:00] [INFO ] Invariant cache hit.
[2024-06-01 11:01:00] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 11:01:00] [INFO ] Invariant cache hit.
[2024-06-01 11:01:01] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-01 11:01:01] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/293 variables, and 149 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5575 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/241 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/293 variables, and 257 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7211 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12804ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12808ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13485 ms. Remains : 156/156 places, 137/137 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:01:15] [INFO ] Invariant cache hit.
[2024-06-01 11:01:15] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2024-06-01 11:01:15] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-06-01 11:01:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:15] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 39 ms returned sat
[2024-06-01 11:01:16] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2024-06-01 11:01:16] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 11:01:16] [INFO ] Added : 21 causal constraints over 5 iterations in 175 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3285 reset in 474 ms.
Product exploration explored 100000 steps with 3284 reset in 402 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:01:17] [INFO ] Invariant cache hit.
[2024-06-01 11:01:17] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 11:01:17] [INFO ] Invariant cache hit.
[2024-06-01 11:01:18] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-06-01 11:01:18] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:01:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/293 variables, and 149 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6344 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/241 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/241 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/293 variables, and 257 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7263 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 13626ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 13629ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14317 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-11 finished in 45078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||((F(p2) U G(F(p2)))&&X((p0 U (p1||G(p0))))))))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-15-LTLCardinality-12
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 287 transition count 150
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 169 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 168 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 160 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 160 transition count 141
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 3 with 1 rules applied. Total rules applied 256 place count 160 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 159 transition count 140
Applied a total of 257 rules in 27 ms. Remains 159 /303 variables (removed 144) and now considering 140/283 (removed 143) transitions.
// Phase 1: matrix 140 rows 159 cols
[2024-06-01 11:01:32] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:01:32] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 11:01:32] [INFO ] Invariant cache hit.
[2024-06-01 11:01:32] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 11:01:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6499 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7445 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 13965ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 13969ms
Starting structural reductions in LI_LTL mode, iteration 1 : 159/303 places, 140/283 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14729 ms. Remains : 159/303 places, 140/283 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-12
Product exploration explored 100000 steps with 719 reset in 293 ms.
Product exploration explored 100000 steps with 722 reset in 330 ms.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 354 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 24 states, 70 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1309 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (248 resets) in 911 ms. (43 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (36 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
[2024-06-01 11:01:50] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf4 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/244 variables, 131/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/299 variables, and 151 constraints, problems are : Problem set: 3 solved, 1 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/159 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf8 is UNSAT
After SMT solving in domain Int declared 244/299 variables, and 150 constraints, problems are : Problem set: 4 solved, 0 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/159 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR (NOT p2) p0 p1)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 12 factoid took 3282 ms. Reduced automaton from 24 states, 70 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1031 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Stuttering acceptance computed with spot in 1098 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-01 11:01:55] [INFO ] Invariant cache hit.
[2024-06-01 11:01:56] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-01 11:01:56] [INFO ] Invariant cache hit.
[2024-06-01 11:01:56] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2024-06-01 11:01:56] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 11:01:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6481 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7037 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 13536ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 13538ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14338 ms. Remains : 159/159 places, 140/140 transitions.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 380 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40001 steps (248 resets) in 1749 ms. (22 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40003 steps (35 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (36 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
[2024-06-01 11:02:12] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf13 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/244 variables, 131/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/299 variables, and 151 constraints, problems are : Problem set: 3 solved, 1 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/159 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Int declared 244/299 variables, and 150 constraints, problems are : Problem set: 4 solved, 0 unsolved in 158 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/159 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 36 factoid took 1462 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 978 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 1113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 1006 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Product exploration explored 100000 steps with 803 reset in 392 ms.
Product exploration explored 100000 steps with 805 reset in 432 ms.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-01 11:02:18] [INFO ] Invariant cache hit.
[2024-06-01 11:02:18] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 11:02:18] [INFO ] Invariant cache hit.
[2024-06-01 11:02:19] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 11:02:19] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-01 11:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5631 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5620 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 11274ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 11276ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11898 ms. Remains : 159/159 places, 140/140 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 58792 ms.
[2024-06-01 11:02:30] [INFO ] Flatten gal took : 23 ms
[2024-06-01 11:02:30] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 11:02:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 283 transitions and 847 arcs took 8 ms.
Total runtime 721241 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HirschbergSinclair-PT-15-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HirschbergSinclair-PT-15-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLCardinality-12

BK_STOP 1717240266566

--------------------
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
mcc2024
ltl formula name HirschbergSinclair-PT-15-LTLCardinality-06
ltl formula formula --ltl=/tmp/2856/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 303 places, 283 transitions and 847 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2856/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2856/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2856/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2856/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): There are 303 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 304, there are 317 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~191 levels ~10000 states ~30916 transitions
pnml2lts-mc( 0/ 4): ~190 levels ~20000 states ~45976 transitions
pnml2lts-mc( 0/ 4): ~190 levels ~40000 states ~97636 transitions
pnml2lts-mc( 0/ 4): ~190 levels ~80000 states ~202072 transitions
pnml2lts-mc( 0/ 4): ~190 levels ~160000 states ~421664 transitions
pnml2lts-mc( 0/ 4): ~190 levels ~320000 states ~876556 transitions
pnml2lts-mc( 0/ 4): ~190 levels ~640000 states ~2389924 transitions
pnml2lts-mc( 2/ 4): ~191 levels ~1280000 states ~5771552 transitions
pnml2lts-mc( 2/ 4): ~191 levels ~2560000 states ~12319112 transitions
pnml2lts-mc( 2/ 4): ~191 levels ~5120000 states ~27108360 transitions
pnml2lts-mc( 2/ 4): ~191 levels ~10240000 states ~56117148 transitions
pnml2lts-mc( 2/ 4): ~191 levels ~20480000 states ~117497664 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550514
pnml2lts-mc( 0/ 4): unique states count: 33550974
pnml2lts-mc( 0/ 4): unique transitions count: 205696994
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 172142703
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551171
pnml2lts-mc( 0/ 4): - cum. max stack depth: 762
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551171 states 205697407 transitions, fanout: 6.131
pnml2lts-mc( 0/ 4): Total exploration time 279.520 sec (279.480 sec minimum, 279.495 sec on average)
pnml2lts-mc( 0/ 4): States per second: 120031, Transitions per second: 735895
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.4MB, 8.2 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 286 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.4MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-15-LTLCardinality-11
ltl formula formula --ltl=/tmp/2856/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 303 places, 283 transitions and 847 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2856/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2856/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2856/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2856/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 304 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 304, there are 285 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~114 levels ~10000 states ~23688 transitions
pnml2lts-mc( 2/ 4): ~115 levels ~20000 states ~49760 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~265!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16783
pnml2lts-mc( 0/ 4): unique states count: 17344
pnml2lts-mc( 0/ 4): unique transitions count: 40816
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 19862
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17347
pnml2lts-mc( 0/ 4): - cum. max stack depth: 611
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17347 states 40865 transitions, fanout: 2.356
pnml2lts-mc( 0/ 4): Total exploration time 0.240 sec (0.240 sec minimum, 0.240 sec on average)
pnml2lts-mc( 0/ 4): States per second: 72279, Transitions per second: 170271
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 18.8 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 286 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-15-LTLCardinality-12
ltl formula formula --ltl=/tmp/2856/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 303 places, 283 transitions and 847 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2856/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2856/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2856/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2856/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 303 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 304, there are 296 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~297 levels ~10000 states ~21924 transitions
pnml2lts-mc( 3/ 4): ~297 levels ~20000 states ~46904 transitions
pnml2lts-mc( 0/ 4): ~295 levels ~40000 states ~99512 transitions
pnml2lts-mc( 0/ 4): ~295 levels ~80000 states ~207844 transitions
pnml2lts-mc( 0/ 4): ~295 levels ~160000 states ~457900 transitions
pnml2lts-mc( 0/ 4): ~295 levels ~320000 states ~1018916 transitions
pnml2lts-mc( 0/ 4): ~295 levels ~640000 states ~2152112 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~1280000 states ~5130236 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~2560000 states ~10649832 transitions
pnml2lts-mc( 0/ 4): ~295 levels ~5120000 states ~22044792 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~10240000 states ~50141640 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~20480000 states ~107526188 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 29961958
pnml2lts-mc( 0/ 4): unique states count: 29962894
pnml2lts-mc( 0/ 4): unique transitions count: 158438924
pnml2lts-mc( 0/ 4): - self-loop count: 28243
pnml2lts-mc( 0/ 4): - claim dead count: 128444842
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 29964751
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1182
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 29964751 states 158442577 transitions, fanout: 5.288
pnml2lts-mc( 0/ 4): Total exploration time 234.230 sec (234.220 sec minimum, 234.225 sec on average)
pnml2lts-mc( 0/ 4): States per second: 127929, Transitions per second: 676440
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 292.6MB, 10.2 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 89.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 286 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 292.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-15, 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 r500-smll-171649587400075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 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 ;