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.r480-tall-171624189500540.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 DBSingleClientW-PT-d1m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717189989709

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:13:11] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-31 21:13:11] [INFO ] Transformed 1440 places.
[2024-05-31 21:13:11] [INFO ] Transformed 672 transitions.
[2024-05-31 21:13:11] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 419
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 419
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 272 place count 248 transition count 404
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 329 place count 191 transition count 347
Iterating global reduction 2 with 57 rules applied. Total rules applied 386 place count 191 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 387 place count 191 transition count 346
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 417 place count 161 transition count 302
Iterating global reduction 3 with 30 rules applied. Total rules applied 447 place count 161 transition count 302
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 472 place count 161 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 476 place count 157 transition count 270
Iterating global reduction 4 with 4 rules applied. Total rules applied 480 place count 157 transition count 270
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 483 place count 154 transition count 267
Iterating global reduction 4 with 3 rules applied. Total rules applied 486 place count 154 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 489 place count 151 transition count 264
Iterating global reduction 4 with 3 rules applied. Total rules applied 492 place count 151 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 494 place count 151 transition count 262
Applied a total of 494 rules in 87 ms. Remains 151 /347 variables (removed 196) and now considering 262/672 (removed 410) transitions.
// Phase 1: matrix 262 rows 151 cols
[2024-05-31 21:13:11] [INFO ] Computed 2 invariants in 21 ms
[2024-05-31 21:13:11] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-31 21:13:11] [INFO ] Invariant cache hit.
[2024-05-31 21:13:12] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-31 21:13:12] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-31 21:13:12] [INFO ] Invariant cache hit.
[2024-05-31 21:13:12] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/413 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 128/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 281 constraints, problems are : Problem set: 0 solved, 261 unsolved in 9802 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/413 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 128/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 261/542 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 0/413 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 542 constraints, problems are : Problem set: 0 solved, 261 unsolved in 25890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
After SMT, in 36369ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 36403ms
Starting structural reductions in LTL mode, iteration 1 : 151/347 places, 262/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37235 ms. Remains : 151/347 places, 262/672 transitions.
Support contains 40 out of 151 places after structural reductions.
[2024-05-31 21:13:49] [INFO ] Flatten gal took : 64 ms
[2024-05-31 21:13:49] [INFO ] Flatten gal took : 27 ms
[2024-05-31 21:13:49] [INFO ] Input system was already deterministic with 262 transitions.
Reduction of identical properties reduced properties to check from 36 to 33
RANDOM walk for 40000 steps (9212 resets) in 2235 ms. (17 steps per ms) remains 28/33 properties
BEST_FIRST walk for 4004 steps (183 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (362 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (186 resets) in 25 ms. (153 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (185 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (211 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (183 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (194 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (193 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (207 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (399 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (172 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (383 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (205 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (361 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (215 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (170 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (182 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (413 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (184 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (200 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (203 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (207 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (197 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (388 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (184 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
[2024-05-31 21:13:50] [INFO ] Invariant cache hit.
[2024-05-31 21:13:50] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 48/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 224/338 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 90/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 8 (OVERLAPS) 75/413 variables, 37/243 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 38/281 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 281 constraints, problems are : Problem set: 1 solved, 26 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 48/80 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-31 21:13:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 33/113 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 222/335 variables, 113/116 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 88/204 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 78/413 variables, 38/242 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 40/282 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 26/308 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 308 constraints, problems are : Problem set: 1 solved, 26 unsolved in 3055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 26/27 constraints, Known Traps: 1/1 constraints]
After SMT, in 4766ms problems are : Problem set: 1 solved, 26 unsolved
Fused 26 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 1497 ms.
Support contains 32 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 149 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 149 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 148 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 148 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 147 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 147 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 146 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 146 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 145 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 145 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 145 transition count 251
Applied a total of 14 rules in 40 ms. Remains 145 /151 variables (removed 6) and now considering 251/262 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 145/151 places, 251/262 transitions.
RANDOM walk for 40000 steps (9118 resets) in 389 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (191 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (412 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (200 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (212 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (177 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (195 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (196 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (211 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (197 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (382 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (196 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (190 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (372 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (200 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (405 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (193 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (163 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (800 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (192 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (377 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (196 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (191 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (193 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (179 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (399 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (195 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 164231 steps, run visited all 26 properties in 738 ms. (steps per millisecond=222 )
Probabilistic random walk after 164231 steps, saw 63549 distinct states, run finished after 741 ms. (steps per millisecond=221 ) properties seen :26
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 561 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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((F(p1)||p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 128 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 114 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 114 transition count 168
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 104 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 104 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 104 transition count 147
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 97 transition count 130
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 97 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 94 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 94 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 94 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 92 transition count 121
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 92 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 91 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 91 transition count 119
Applied a total of 134 rules in 29 ms. Remains 91 /151 variables (removed 60) and now considering 119/262 (removed 143) transitions.
// Phase 1: matrix 119 rows 91 cols
[2024-05-31 21:13:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:13:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:13:58] [INFO ] Invariant cache hit.
[2024-05-31 21:13:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:13:58] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-31 21:13:58] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-31 21:13:58] [INFO ] Invariant cache hit.
[2024-05-31 21:13:58] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/210 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-31 21:13:59] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-31 21:14:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 136 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/210 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 118/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 254 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 9799ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 9801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/151 places, 119/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10066 ms. Remains : 91/151 places, 119/262 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-00
Product exploration explored 100000 steps with 23026 reset in 226 ms.
Product exploration explored 100000 steps with 22952 reset in 188 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 312 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9097 resets) in 383 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3923 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1911 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3909 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2020220 steps, run timeout after 3001 ms. (steps per millisecond=673 ) properties seen :3 out of 4
Probabilistic random walk after 2020220 steps, saw 767388 distinct states, run finished after 3011 ms. (steps per millisecond=670 ) properties seen :3
[2024-05-31 21:14:12] [INFO ] Invariant cache hit.
[2024-05-31 21:14:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 37/210 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/91 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 28ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-00 finished in 14383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X(((X(p2) U p3)&&p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 202
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 130 transition count 199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 117 transition count 183
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 117 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 117 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 108 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 108 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 108 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 103 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 103 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 103 transition count 146
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 100 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 100 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 100 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 98 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 98 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 97 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 97 transition count 137
Applied a total of 120 rules in 16 ms. Remains 97 /151 variables (removed 54) and now considering 137/262 (removed 125) transitions.
// Phase 1: matrix 137 rows 97 cols
[2024-05-31 21:14:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:14:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:14:12] [INFO ] Invariant cache hit.
[2024-05-31 21:14:12] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-31 21:14:12] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 21:14:12] [INFO ] Invariant cache hit.
[2024-05-31 21:14:12] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/234 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 21:14:14] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:14:14] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:14:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 156 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/234 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 54/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 136/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 292 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 3/3 constraints]
After SMT, in 10248ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 10250ms
Starting structural reductions in LTL mode, iteration 1 : 97/151 places, 137/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10492 ms. Remains : 97/151 places, 137/262 transitions.
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p1)), true, (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-01 finished in 10985 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(p1)||X(X(G(p2)))||p0)))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 115 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 115 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 115 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 105 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 105 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 105 transition count 150
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 98 transition count 135
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 98 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 123 place count 98 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 96 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 96 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 95 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 94 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 94 transition count 123
Applied a total of 133 rules in 23 ms. Remains 94 /151 variables (removed 57) and now considering 123/262 (removed 139) transitions.
// Phase 1: matrix 123 rows 94 cols
[2024-05-31 21:14:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:14:23] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 21:14:23] [INFO ] Invariant cache hit.
[2024-05-31 21:14:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:14:23] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-31 21:14:23] [INFO ] Invariant cache hit.
[2024-05-31 21:14:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8546ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8548ms
Starting structural reductions in LTL mode, iteration 1 : 94/151 places, 123/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8813 ms. Remains : 94/151 places, 123/262 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-02 finished in 9493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(G(p0)))||G(p1))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 114 transition count 172
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 114 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 103 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 103 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 103 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 96 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 93 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 91 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 90 transition count 118
Applied a total of 140 rules in 17 ms. Remains 90 /151 variables (removed 61) and now considering 118/262 (removed 144) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-31 21:14:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:14:33] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:14:33] [INFO ] Invariant cache hit.
[2024-05-31 21:14:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:14:33] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-31 21:14:33] [INFO ] Invariant cache hit.
[2024-05-31 21:14:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7105ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7107ms
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 118/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7339 ms. Remains : 90/151 places, 118/262 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-04
Product exploration explored 100000 steps with 23049 reset in 123 ms.
Product exploration explored 100000 steps with 22855 reset in 130 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9208 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1929 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1915 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1935 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1848638 steps, run timeout after 3001 ms. (steps per millisecond=616 ) properties seen :5 out of 6
Probabilistic random walk after 1848638 steps, saw 710211 distinct states, run finished after 3001 ms. (steps per millisecond=616 ) properties seen :5
[2024-05-31 21:14:44] [INFO ] Invariant cache hit.
[2024-05-31 21:14:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/149 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 11/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:14:45] [INFO ] Invariant cache hit.
[2024-05-31 21:14:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 21:14:45] [INFO ] Invariant cache hit.
[2024-05-31 21:14:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:14:45] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-31 21:14:45] [INFO ] Invariant cache hit.
[2024-05-31 21:14:45] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2464 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7327ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7330ms
Finished structural reductions in LTL mode , in 1 iterations and 7541 ms. Remains : 90/90 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9193 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1911 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21241 steps, run visited all 3 properties in 70 ms. (steps per millisecond=303 )
Probabilistic random walk after 21241 steps, saw 10079 distinct states, run finished after 71 ms. (steps per millisecond=299 ) properties seen :3
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23002 reset in 124 ms.
Product exploration explored 100000 steps with 22911 reset in 130 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:14:55] [INFO ] Redundant transitions in 3 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-31 21:14:55] [INFO ] Invariant cache hit.
[2024-05-31 21:14:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7340ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7347ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7369 ms. Remains : 90/90 places, 118/118 transitions.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:15:03] [INFO ] Invariant cache hit.
[2024-05-31 21:15:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:15:03] [INFO ] Invariant cache hit.
[2024-05-31 21:15:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:15:03] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-31 21:15:03] [INFO ] Invariant cache hit.
[2024-05-31 21:15:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7233ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7235ms
Finished structural reductions in LTL mode , in 1 iterations and 7453 ms. Remains : 90/90 places, 118/118 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-04 finished in 37880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 130 transition count 194
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 117 transition count 181
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 117 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 117 transition count 176
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 108 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 108 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 108 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 102 transition count 142
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 114 place count 102 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 100 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 100 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 100 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 99 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 99 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 98 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 98 transition count 131
Applied a total of 124 rules in 22 ms. Remains 98 /151 variables (removed 53) and now considering 131/262 (removed 131) transitions.
// Phase 1: matrix 131 rows 98 cols
[2024-05-31 21:15:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:15:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 21:15:10] [INFO ] Invariant cache hit.
[2024-05-31 21:15:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:15:11] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-31 21:15:11] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-31 21:15:11] [INFO ] Invariant cache hit.
[2024-05-31 21:15:11] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 143 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 130/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 273 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5784 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 8540ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 8542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/151 places, 131/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8784 ms. Remains : 98/151 places, 131/262 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-05
Product exploration explored 100000 steps with 23003 reset in 236 ms.
Product exploration explored 100000 steps with 22904 reset in 198 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 338 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
RANDOM walk for 40000 steps (9120 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20881 steps, run visited all 1 properties in 45 ms. (steps per millisecond=464 )
Probabilistic random walk after 20881 steps, saw 9429 distinct states, run finished after 45 ms. (steps per millisecond=464 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 3 out of 98 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 : 98/98 places, 131/131 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-31 21:15:20] [INFO ] Invariant cache hit.
[2024-05-31 21:15:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:15:20] [INFO ] Invariant cache hit.
[2024-05-31 21:15:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:15:20] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-31 21:15:20] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-31 21:15:20] [INFO ] Invariant cache hit.
[2024-05-31 21:15:20] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 143 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2708 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 130/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 273 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 8387ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 8389ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8615 ms. Remains : 98/98 places, 131/131 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 338 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
RANDOM walk for 40000 steps (9238 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1939 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20881 steps, run visited all 1 properties in 43 ms. (steps per millisecond=485 )
Probabilistic random walk after 20881 steps, saw 9429 distinct states, run finished after 44 ms. (steps per millisecond=474 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22915 reset in 150 ms.
Product exploration explored 100000 steps with 22969 reset in 152 ms.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 131/131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 95 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 94 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 94 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 94 transition count 123
Applied a total of 9 rules in 9 ms. Remains 94 /98 variables (removed 4) and now considering 123/131 (removed 8) transitions.
// Phase 1: matrix 123 rows 94 cols
[2024-05-31 21:15:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:15:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:15:30] [INFO ] Invariant cache hit.
[2024-05-31 21:15:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:15:30] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-31 21:15:30] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-31 21:15:30] [INFO ] Invariant cache hit.
[2024-05-31 21:15:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8604ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8607ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 123/131 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8865 ms. Remains : 94/98 places, 123/131 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-05 finished in 28043 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) U G(!p1)))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 128 transition count 185
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 113 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 84 place count 113 transition count 165
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 103 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 103 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 103 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 97 transition count 127
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 97 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 97 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 93 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 93 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 93 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 134 place count 90 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 137 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 139 place count 89 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 140 place count 89 transition count 114
Applied a total of 140 rules in 17 ms. Remains 89 /151 variables (removed 62) and now considering 114/262 (removed 148) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-31 21:15:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:15:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 21:15:38] [INFO ] Invariant cache hit.
[2024-05-31 21:15:38] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:15:39] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-31 21:15:39] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-31 21:15:39] [INFO ] Invariant cache hit.
[2024-05-31 21:15:39] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7420ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/151 places, 114/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7643 ms. Remains : 89/151 places, 114/262 transitions.
Stuttering acceptance computed with spot in 79 ms :[p1, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-06
Product exploration explored 100000 steps with 22994 reset in 124 ms.
Product exploration explored 100000 steps with 22953 reset in 138 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p1, (NOT p0)]
RANDOM walk for 40000 steps (9190 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1905 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3877 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 19969 steps, run visited all 3 properties in 49 ms. (steps per millisecond=407 )
Probabilistic random walk after 19969 steps, saw 9139 distinct states, run finished after 49 ms. (steps per millisecond=407 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[p1, (NOT p0)]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-31 21:15:47] [INFO ] Invariant cache hit.
[2024-05-31 21:15:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 21:15:47] [INFO ] Invariant cache hit.
[2024-05-31 21:15:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:15:47] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-31 21:15:47] [INFO ] Redundant transitions in 0 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-31 21:15:47] [INFO ] Invariant cache hit.
[2024-05-31 21:15:47] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5090 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7343ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7344ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7612 ms. Remains : 89/89 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p1, (NOT p0)]
RANDOM walk for 40000 steps (9182 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3958 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 19969 steps, run visited all 3 properties in 50 ms. (steps per millisecond=399 )
Probabilistic random walk after 19969 steps, saw 9139 distinct states, run finished after 50 ms. (steps per millisecond=399 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 22885 reset in 126 ms.
Product exploration explored 100000 steps with 22916 reset in 134 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-31 21:15:56] [INFO ] Invariant cache hit.
[2024-05-31 21:15:56] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 21:15:56] [INFO ] Invariant cache hit.
[2024-05-31 21:15:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:15:56] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-31 21:15:56] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-31 21:15:56] [INFO ] Invariant cache hit.
[2024-05-31 21:15:56] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7196ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7198ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7454 ms. Remains : 89/89 places, 114/114 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-06 finished in 24714 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 p1) U p2))&&(X(p0)||G(p3))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 130 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 116 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 116 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 106 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 106 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 106 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 100 transition count 137
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 100 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 100 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 98 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 98 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 96 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 96 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 95 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 95 transition count 127
Applied a total of 127 rules in 8 ms. Remains 95 /151 variables (removed 56) and now considering 127/262 (removed 135) transitions.
// Phase 1: matrix 127 rows 95 cols
[2024-05-31 21:16:03] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:16:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 21:16:03] [INFO ] Invariant cache hit.
[2024-05-31 21:16:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:16:03] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-31 21:16:03] [INFO ] Invariant cache hit.
[2024-05-31 21:16:03] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/222 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 43/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-31 21:16:06] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:16:06] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/222 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-31 21:16:07] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:16:07] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 144 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/222 variables, 95/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 126/270 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 270 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5603 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 11123ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 11124ms
Starting structural reductions in LTL mode, iteration 1 : 95/151 places, 127/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11344 ms. Remains : 95/151 places, 127/262 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), true, p1, (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-07 finished in 11610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 188
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 113 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 85 place count 113 transition count 165
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 102 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 102 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 102 transition count 143
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 94 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 94 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 131 place count 94 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 91 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 91 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 89 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 88 transition count 110
Applied a total of 145 rules in 18 ms. Remains 88 /151 variables (removed 63) and now considering 110/262 (removed 152) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-31 21:16:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:16:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:16:15] [INFO ] Invariant cache hit.
[2024-05-31 21:16:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:16:15] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-31 21:16:15] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-31 21:16:15] [INFO ] Invariant cache hit.
[2024-05-31 21:16:15] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6123ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/151 places, 110/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6373 ms. Remains : 88/151 places, 110/262 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-10 finished in 6463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(!p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 115 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 115 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 115 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 154
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 105 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 98 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 98 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 95 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 95 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 95 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 93 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 92 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 92 transition count 122
Applied a total of 134 rules in 5 ms. Remains 92 /151 variables (removed 59) and now considering 122/262 (removed 140) transitions.
// Phase 1: matrix 122 rows 92 cols
[2024-05-31 21:16:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:16:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:16:21] [INFO ] Invariant cache hit.
[2024-05-31 21:16:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:16:21] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 21:16:21] [INFO ] Invariant cache hit.
[2024-05-31 21:16:21] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 138 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 121/259 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 259 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 7027ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 7028ms
Starting structural reductions in LTL mode, iteration 1 : 92/151 places, 122/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7244 ms. Remains : 92/151 places, 122/262 transitions.
Stuttering acceptance computed with spot in 154 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 317 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-11 finished in 7723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||X(G(p2))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 186
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 115 transition count 169
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 115 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 115 transition count 164
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 105 transition count 142
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 98 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 98 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 98 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 94 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 94 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 94 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 133 place count 91 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 136 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 90 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 90 transition count 114
Applied a total of 139 rules in 11 ms. Remains 90 /151 variables (removed 61) and now considering 114/262 (removed 148) transitions.
// Phase 1: matrix 114 rows 90 cols
[2024-05-31 21:16:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:16:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 21:16:29] [INFO ] Invariant cache hit.
[2024-05-31 21:16:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:16:29] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-31 21:16:29] [INFO ] Invariant cache hit.
[2024-05-31 21:16:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 113/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 245 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4790 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7120ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7122ms
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 114/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7327 ms. Remains : 90/151 places, 114/262 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-12 finished in 7488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 194
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 112 transition count 171
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 112 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 112 transition count 166
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 100 transition count 145
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 100 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 100 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 123 place count 92 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 92 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 92 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 88 transition count 115
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 88 transition count 113
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 85 transition count 110
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 85 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 84 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 84 transition count 107
Applied a total of 153 rules in 12 ms. Remains 84 /151 variables (removed 67) and now considering 107/262 (removed 155) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-31 21:16:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:16:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 21:16:36] [INFO ] Invariant cache hit.
[2024-05-31 21:16:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:16:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-31 21:16:37] [INFO ] Invariant cache hit.
[2024-05-31 21:16:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-31 21:16:38] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-31 21:16:39] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:16:39] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/191 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 106/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 232 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 8525ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 8526ms
Starting structural reductions in LTL mode, iteration 1 : 84/151 places, 107/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8720 ms. Remains : 84/151 places, 107/262 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-13 finished in 8806 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)&&X(X(((p1 U p2) U p3))))))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 199
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 131 transition count 195
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 118 transition count 179
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 118 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 118 transition count 176
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 110 transition count 163
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 110 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 110 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 105 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 105 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 105 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 103 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 103 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 102 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 102 transition count 140
Applied a total of 111 rules in 8 ms. Remains 102 /151 variables (removed 49) and now considering 140/262 (removed 122) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-31 21:16:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:16:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:16:45] [INFO ] Invariant cache hit.
[2024-05-31 21:16:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-31 21:16:45] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-31 21:16:45] [INFO ] Invariant cache hit.
[2024-05-31 21:16:45] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/242 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 156 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/242 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 139/295 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 295 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 10360ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 10363ms
Starting structural reductions in LTL mode, iteration 1 : 102/151 places, 140/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10626 ms. Remains : 102/151 places, 140/262 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-15 finished in 10907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(G(p0)))||G(p1))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m10-LTLFireability-04
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 114 transition count 172
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 114 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 103 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 103 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 103 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 96 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 93 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 91 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 90 transition count 118
Applied a total of 140 rules in 24 ms. Remains 90 /151 variables (removed 61) and now considering 118/262 (removed 144) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-31 21:16:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:16:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 21:16:57] [INFO ] Invariant cache hit.
[2024-05-31 21:16:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:16:57] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-31 21:16:57] [INFO ] Invariant cache hit.
[2024-05-31 21:16:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7242ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7243ms
Starting structural reductions in LI_LTL mode, iteration 1 : 90/151 places, 118/262 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7475 ms. Remains : 90/151 places, 118/262 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-04
Product exploration explored 100000 steps with 22985 reset in 116 ms.
Product exploration explored 100000 steps with 22937 reset in 128 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9106 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1905 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1915 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1861 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1803729 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :5 out of 6
Probabilistic random walk after 1803729 steps, saw 693681 distinct states, run finished after 3001 ms. (steps per millisecond=601 ) properties seen :5
[2024-05-31 21:17:08] [INFO ] Invariant cache hit.
[2024-05-31 21:17:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/149 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 11/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 339 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:17:09] [INFO ] Invariant cache hit.
[2024-05-31 21:17:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:17:09] [INFO ] Invariant cache hit.
[2024-05-31 21:17:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:17:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-31 21:17:09] [INFO ] Invariant cache hit.
[2024-05-31 21:17:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6990ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6992ms
Finished structural reductions in LTL mode , in 1 iterations and 7227 ms. Remains : 90/90 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9158 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1954 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1937 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21241 steps, run visited all 3 properties in 58 ms. (steps per millisecond=366 )
Probabilistic random walk after 21241 steps, saw 10079 distinct states, run finished after 58 ms. (steps per millisecond=366 ) properties seen :3
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22984 reset in 114 ms.
Product exploration explored 100000 steps with 23070 reset in 126 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:17:19] [INFO ] Redundant transitions in 1 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-31 21:17:19] [INFO ] Invariant cache hit.
[2024-05-31 21:17:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7089ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7100 ms. Remains : 90/90 places, 118/118 transitions.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 21:17:26] [INFO ] Invariant cache hit.
[2024-05-31 21:17:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 21:17:26] [INFO ] Invariant cache hit.
[2024-05-31 21:17:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:17:26] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-31 21:17:26] [INFO ] Invariant cache hit.
[2024-05-31 21:17:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7134ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7135ms
Finished structural reductions in LTL mode , in 1 iterations and 7332 ms. Remains : 90/90 places, 118/118 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-04 finished in 37022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
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) U G(!p1)))'
[2024-05-31 21:17:33] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:17:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:17:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 262 transitions and 1028 arcs took 5 ms.
Total runtime 262780 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717190256385

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DBSingleClientW-PT-d1m10-LTLFireability-04
ltl formula formula --ltl=/tmp/2089/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 151 places, 262 transitions and 1028 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.090 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2089/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2089/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2089/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2089/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 153 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 152, there are 284 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~57 levels ~10000 states ~30156 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~224!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10524
pnml2lts-mc( 0/ 4): unique states count: 11755
pnml2lts-mc( 0/ 4): unique transitions count: 35041
pnml2lts-mc( 0/ 4): - self-loop count: 18755
pnml2lts-mc( 0/ 4): - claim dead count: 1789
pnml2lts-mc( 0/ 4): - claim found count: 657
pnml2lts-mc( 0/ 4): - claim success count: 11780
pnml2lts-mc( 0/ 4): - cum. max stack depth: 655
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11788 states 35182 transitions, fanout: 2.985
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.090 sec minimum, 0.107 sec on average)
pnml2lts-mc( 0/ 4): States per second: 98233, Transitions per second: 293183
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 13.2 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 265 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m10-LTLFireability-05
ltl formula formula --ltl=/tmp/2089/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
pnml2lts-mc( 0/ 4): Petri net has 151 places, 262 transitions and 1028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2089/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2089/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2089/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2089/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 152 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 152, there are 279 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~157!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1916
pnml2lts-mc( 0/ 4): unique states count: 2252
pnml2lts-mc( 0/ 4): unique transitions count: 6909
pnml2lts-mc( 0/ 4): - self-loop count: 3372
pnml2lts-mc( 0/ 4): - claim dead count: 262
pnml2lts-mc( 0/ 4): - claim found count: 74
pnml2lts-mc( 0/ 4): - claim success count: 2278
pnml2lts-mc( 0/ 4): - cum. max stack depth: 300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2278 states 7017 transitions, fanout: 3.080
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 75933, Transitions per second: 233900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.0 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 265 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m10-LTLFireability-06
ltl formula formula --ltl=/tmp/2089/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
pnml2lts-mc( 0/ 4): Petri net has 151 places, 262 transitions and 1028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2089/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2089/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2089/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2089/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 152 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 152, there are 274 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~134 levels ~10000 states ~31668 transitions
pnml2lts-mc( 0/ 4): ~148 levels ~20000 states ~62136 transitions
pnml2lts-mc( 0/ 4): ~225 levels ~40000 states ~124552 transitions
pnml2lts-mc( 0/ 4): ~277 levels ~80000 states ~248724 transitions
pnml2lts-mc( 0/ 4): ~512 levels ~160000 states ~497280 transitions
pnml2lts-mc( 2/ 4): ~45 levels ~320000 states ~972948 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~1433!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 263711
pnml2lts-mc( 0/ 4): unique states count: 266678
pnml2lts-mc( 0/ 4): unique transitions count: 817137
pnml2lts-mc( 0/ 4): - self-loop count: 446276
pnml2lts-mc( 0/ 4): - claim dead count: 90069
pnml2lts-mc( 0/ 4): - claim found count: 1028
pnml2lts-mc( 0/ 4): - claim success count: 266703
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 266703 states 817232 transitions, fanout: 3.064
pnml2lts-mc( 0/ 4): Total exploration time 1.650 sec (1.650 sec minimum, 1.650 sec on average)
pnml2lts-mc( 0/ 4): States per second: 161638, Transitions per second: 495292
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.6MB, 9.7 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 265 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.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="DBSingleClientW-PT-d1m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d1m10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189500540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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