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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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-d1m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716292141103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:49:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:49:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:49:02] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-21 11:49:02] [INFO ] Transformed 1440 places.
[2024-05-21 11:49:02] [INFO ] Transformed 672 transitions.
[2024-05-21 11:49:02] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 412
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 412
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 269 place count 246 transition count 404
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 330 place count 185 transition count 343
Iterating global reduction 2 with 61 rules applied. Total rules applied 391 place count 185 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 393 place count 185 transition count 341
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 423 place count 155 transition count 297
Iterating global reduction 3 with 30 rules applied. Total rules applied 453 place count 155 transition count 297
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 480 place count 155 transition count 270
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 485 place count 150 transition count 263
Iterating global reduction 4 with 5 rules applied. Total rules applied 490 place count 150 transition count 263
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 493 place count 147 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 496 place count 147 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 498 place count 145 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 500 place count 145 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 501 place count 144 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 144 transition count 256
Applied a total of 502 rules in 84 ms. Remains 144 /347 variables (removed 203) and now considering 256/672 (removed 416) transitions.
// Phase 1: matrix 256 rows 144 cols
[2024-05-21 11:49:02] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 11:49:03] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-21 11:49:03] [INFO ] Invariant cache hit.
[2024-05-21 11:49:03] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-21 11:49:03] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 11:49:03] [INFO ] Invariant cache hit.
[2024-05-21 11:49:03] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/400 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 122/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 268 constraints, problems are : Problem set: 0 solved, 255 unsolved in 9001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/400 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 122/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 255/523 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 523 constraints, problems are : Problem set: 0 solved, 255 unsolved in 19193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
After SMT, in 28799ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 28827ms
Starting structural reductions in LTL mode, iteration 1 : 144/347 places, 256/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29573 ms. Remains : 144/347 places, 256/672 transitions.
Support contains 31 out of 144 places after structural reductions.
[2024-05-21 11:49:32] [INFO ] Flatten gal took : 46 ms
[2024-05-21 11:49:32] [INFO ] Flatten gal took : 21 ms
[2024-05-21 11:49:32] [INFO ] Input system was already deterministic with 256 transitions.
Support contains 29 out of 144 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (9158 resets) in 2998 ms. (13 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 62 ms. (63 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (185 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (413 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (181 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (198 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (196 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (181 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (198 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (384 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (182 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (191 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (368 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (181 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (184 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (358 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (189 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (196 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (188 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (188 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (209 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (192 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (172 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (169 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (203 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (190 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (208 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 101330 steps, run visited all 26 properties in 475 ms. (steps per millisecond=213 )
Probabilistic random walk after 101330 steps, saw 40497 distinct states, run finished after 479 ms. (steps per millisecond=211 ) properties seen :26
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 545 edges and 144 vertex of which 143 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' '!(G(X(F(F((!(p0 U p1)||G(!p0)))))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 122 transition count 184
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 109 transition count 168
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 109 transition count 168
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 109 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 91 place count 98 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 102 place count 98 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 98 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 116 place count 90 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 90 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 90 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 132 place count 86 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 139 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 85 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 85 transition count 110
Applied a total of 141 rules in 28 ms. Remains 85 /144 variables (removed 59) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 85 cols
[2024-05-21 11:49:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:49:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 11:49:34] [INFO ] Invariant cache hit.
[2024-05-21 11:49:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:49:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 11:49:34] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:49:34] [INFO ] Invariant cache hit.
[2024-05-21 11:49:34] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:49:36] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 8 ms to minimize.
[2024-05-21 11:49:36] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2623 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/195 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 109/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 6946ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6948ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7160 ms. Remains : 85/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-00
Product exploration explored 100000 steps with 22898 reset in 203 ms.
Product exploration explored 100000 steps with 23074 reset in 160 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 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 (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 103 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (9177 resets) in 430 ms. (92 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1876 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (6221 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 3019512 steps, run timeout after 3001 ms. (steps per millisecond=1006 ) properties seen :4 out of 5
Probabilistic random walk after 3019512 steps, saw 1192735 distinct states, run finished after 3007 ms. (steps per millisecond=1004 ) properties seen :4
[2024-05-21 11:49:45] [INFO ] Invariant cache hit.
[2024-05-21 11:49:45] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 34/195 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/85 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 331 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 84 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:49:46] [INFO ] Invariant cache hit.
[2024-05-21 11:49:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:49:46] [INFO ] Invariant cache hit.
[2024-05-21 11:49:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:49:46] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 11:49:46] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:49:46] [INFO ] Invariant cache hit.
[2024-05-21 11:49:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:49:47] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 11:49:47] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/195 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 109/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 6949ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6951ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7145 ms. Remains : 85/85 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 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 (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 109 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (9103 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1843 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1962 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (6168 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2819726 steps, run timeout after 3001 ms. (steps per millisecond=939 ) properties seen :4 out of 5
Probabilistic random walk after 2819726 steps, saw 1118215 distinct states, run finished after 3001 ms. (steps per millisecond=939 ) properties seen :4
[2024-05-21 11:49:56] [INFO ] Invariant cache hit.
[2024-05-21 11:49:56] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 34/195 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/85 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 273 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 87 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 22920 reset in 107 ms.
Product exploration explored 100000 steps with 22902 reset in 109 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:49:57] [INFO ] Invariant cache hit.
[2024-05-21 11:49:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 11:49:57] [INFO ] Invariant cache hit.
[2024-05-21 11:49:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:49:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 11:49:57] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:49:57] [INFO ] Invariant cache hit.
[2024-05-21 11:49:57] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:49:59] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:49:59] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/195 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 109/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7172ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7173ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7366 ms. Remains : 85/85 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-00 finished in 30652 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 180
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 121 transition count 176
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 108 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 108 transition count 160
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 108 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 98 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 98 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 98 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 91 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 91 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 91 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 108
Applied a total of 136 rules in 23 ms. Remains 86 /144 variables (removed 58) and now considering 108/256 (removed 148) transitions.
// Phase 1: matrix 108 rows 86 cols
[2024-05-21 11:50:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:50:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 11:50:05] [INFO ] Invariant cache hit.
[2024-05-21 11:50:05] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:50:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 11:50:05] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 11:50:05] [INFO ] Invariant cache hit.
[2024-05-21 11:50:05] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3965 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 5897ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5898ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/144 places, 108/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6101 ms. Remains : 86/144 places, 108/256 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-01
Product exploration explored 100000 steps with 22906 reset in 162 ms.
Product exploration explored 100000 steps with 22921 reset in 107 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9195 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3886 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16094 steps, run visited all 1 properties in 20 ms. (steps per millisecond=804 )
Probabilistic random walk after 16094 steps, saw 7657 distinct states, run finished after 20 ms. (steps per millisecond=804 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 108/108 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 11:50:12] [INFO ] Invariant cache hit.
[2024-05-21 11:50:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 11:50:12] [INFO ] Invariant cache hit.
[2024-05-21 11:50:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:50:12] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 11:50:12] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 11:50:12] [INFO ] Invariant cache hit.
[2024-05-21 11:50:12] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 5873ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5874ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6055 ms. Remains : 86/86 places, 108/108 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9176 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3993 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16094 steps, run visited all 1 properties in 21 ms. (steps per millisecond=766 )
Probabilistic random walk after 16094 steps, saw 7657 distinct states, run finished after 21 ms. (steps per millisecond=766 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22958 reset in 104 ms.
Product exploration explored 100000 steps with 22961 reset in 111 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 108/108 transitions.
Applied a total of 0 rules in 10 ms. Remains 86 /86 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 11:50:18] [INFO ] Invariant cache hit.
[2024-05-21 11:50:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 11:50:18] [INFO ] Invariant cache hit.
[2024-05-21 11:50:19] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:50:19] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-21 11:50:19] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 11:50:19] [INFO ] Invariant cache hit.
[2024-05-21 11:50:19] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6014ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6015ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6212 ms. Remains : 86/86 places, 108/108 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-01 finished in 19987 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 109 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 109 transition count 164
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 109 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 99 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 99 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 99 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 92 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 92 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 92 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 89 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 89 transition count 113
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 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 88 transition count 110
Applied a total of 136 rules in 27 ms. Remains 88 /144 variables (removed 56) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 11:50:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:50:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:50:25] [INFO ] Invariant cache hit.
[2024-05-21 11:50:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:50:25] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 11:50:25] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:50:25] [INFO ] Invariant cache hit.
[2024-05-21 11:50:25] [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
All remaining problems are real, not stopping.
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 1878 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 4373 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 6332ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6543 ms. Remains : 88/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-03
Product exploration explored 100000 steps with 23027 reset in 108 ms.
Product exploration explored 100000 steps with 22867 reset in 116 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9180 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1930 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 28 ms. (steps per millisecond=623 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 28 ms. (steps per millisecond=623 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:50:32] [INFO ] Invariant cache hit.
[2024-05-21 11:50:32] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:50:32] [INFO ] Invariant cache hit.
[2024-05-21 11:50:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:50:32] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 11:50:32] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:50:32] [INFO ] Invariant cache hit.
[2024-05-21 11:50:32] [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
All remaining problems are real, not stopping.
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 1942 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 4373 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 6398ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6604 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9222 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1866 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 22 ms. (steps per millisecond=793 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 22 ms. (steps per millisecond=793 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22958 reset in 122 ms.
Product exploration explored 100000 steps with 23034 reset in 112 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 9 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:50:40] [INFO ] Invariant cache hit.
[2024-05-21 11:50:40] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:50:40] [INFO ] Invariant cache hit.
[2024-05-21 11:50:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:50:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 11:50:40] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:50:40] [INFO ] Invariant cache hit.
[2024-05-21 11:50:40] [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
All remaining problems are real, not stopping.
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 1951 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 4322 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 6360ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6362ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6553 ms. Remains : 88/88 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-03 finished in 21407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((p1 U p2)&&F(p3)))||p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 190
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 190
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 123 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 112 transition count 173
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 112 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 112 transition count 169
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 103 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 103 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 103 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 98 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 98 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 98 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 95 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 95 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 95 transition count 133
Applied a total of 117 rules in 8 ms. Remains 95 /144 variables (removed 49) and now considering 133/256 (removed 123) transitions.
// Phase 1: matrix 133 rows 95 cols
[2024-05-21 11:50:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:50:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 11:50:46] [INFO ] Invariant cache hit.
[2024-05-21 11:50:46] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 11:50:46] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-21 11:50:46] [INFO ] Invariant cache hit.
[2024-05-21 11:50:46] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/228 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 53/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 150 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/228 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 53/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 132/282 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 282 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5397 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8251ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8253ms
Starting structural reductions in LTL mode, iteration 1 : 95/144 places, 133/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8476 ms. Remains : 95/144 places, 133/256 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-04 finished in 8758 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 180
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 121 transition count 176
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 109 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 109 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 109 transition count 157
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 98 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 98 transition count 140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 98 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 91 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 91 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 91 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 87 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 87 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 86 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 86 transition count 110
Applied a total of 137 rules in 20 ms. Remains 86 /144 variables (removed 58) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 86 cols
[2024-05-21 11:50:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:50:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 11:50:55] [INFO ] Invariant cache hit.
[2024-05-21 11:50:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 11:50:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 11:50:55] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:50:55] [INFO ] Invariant cache hit.
[2024-05-21 11:50:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 126 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 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/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 109/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 235 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6576ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6578ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6784 ms. Remains : 86/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-05
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-05 finished in 6884 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)&&F((p1||X(F(p2))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 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 46 place count 123 transition count 190
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 111 transition count 175
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 111 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 111 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 102 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 102 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 102 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 96 transition count 134
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 96 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 115 place count 96 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 93 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 93 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 123 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 92 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 92 transition count 125
Applied a total of 125 rules in 19 ms. Remains 92 /144 variables (removed 52) and now considering 125/256 (removed 131) transitions.
// Phase 1: matrix 125 rows 92 cols
[2024-05-21 11:51:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:51:02] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:51:02] [INFO ] Invariant cache hit.
[2024-05-21 11:51:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 11:51:02] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-21 11:51:02] [INFO ] Invariant cache hit.
[2024-05-21 11:51:02] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/217 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 141 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/217 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 124/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 265 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 7464ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7465ms
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 125/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7673 ms. Remains : 92/144 places, 125/256 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 318 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 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-06 finished in 8292 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) U !p1)||F((F(G(p1))&&p2)))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 122 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 109 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 109 transition count 165
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 109 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 98 transition count 143
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 98 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 98 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 91 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 91 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 91 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 113
Applied a total of 136 rules in 12 ms. Remains 86 /144 variables (removed 58) and now considering 113/256 (removed 143) transitions.
// Phase 1: matrix 113 rows 86 cols
[2024-05-21 11:51:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:51:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:51:10] [INFO ] Invariant cache hit.
[2024-05-21 11:51:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:51:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 11:51:10] [INFO ] Invariant cache hit.
[2024-05-21 11:51:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/199 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 41/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 129 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/199 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 41/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 6654ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6656ms
Starting structural reductions in LTL mode, iteration 1 : 86/144 places, 113/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6831 ms. Remains : 86/144 places, 113/256 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p2) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-07 finished in 7092 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((G(p0)||F((p1||G(!p2)||X(p3))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 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 46 place count 123 transition count 190
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 112 transition count 179
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 112 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 112 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 103 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 103 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 99 place count 103 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 97 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 97 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 97 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 116 place count 93 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 93 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 93 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 92 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 92 transition count 127
Applied a total of 125 rules in 20 ms. Remains 92 /144 variables (removed 52) and now considering 127/256 (removed 129) transitions.
// Phase 1: matrix 127 rows 92 cols
[2024-05-21 11:51:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 11:51:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:51:17] [INFO ] Invariant cache hit.
[2024-05-21 11:51:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 11:51:17] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 11:51:17] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-21 11:51:17] [INFO ] Invariant cache hit.
[2024-05-21 11:51:17] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/219 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:19] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:51:19] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 11:51:19] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:20] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/219 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 126/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 271 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 10291ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/144 places, 127/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10504 ms. Remains : 92/144 places, 127/256 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-08
Product exploration explored 100000 steps with 23112 reset in 124 ms.
Product exploration explored 100000 steps with 22853 reset in 133 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 319 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 15 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (9141 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1906 resets) in 312 ms. (127 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1912 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1939 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1814 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3919 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1930 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 26119 steps, run visited all 7 properties in 129 ms. (steps per millisecond=202 )
Probabilistic random walk after 26119 steps, saw 11985 distinct states, run finished after 129 ms. (steps per millisecond=202 ) properties seen :7
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0), (F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F p2)]
Knowledge based reduction with 11 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 11:51:29] [INFO ] Invariant cache hit.
[2024-05-21 11:51:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:51:29] [INFO ] Invariant cache hit.
[2024-05-21 11:51:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 11:51:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 11:51:29] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-21 11:51:29] [INFO ] Invariant cache hit.
[2024-05-21 11:51:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/219 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:31] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:51:31] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-05-21 11:51:31] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:32] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:32] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4574 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/219 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 126/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 271 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 10132ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10338 ms. Remains : 92/92 places, 127/127 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 319 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 15 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (9187 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1905 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1937 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1854 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1858 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1843 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3960 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1890 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 26119 steps, run visited all 7 properties in 166 ms. (steps per millisecond=157 )
Probabilistic random walk after 26119 steps, saw 11985 distinct states, run finished after 166 ms. (steps per millisecond=157 ) properties seen :7
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0), (F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F p2)]
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Product exploration explored 100000 steps with 22942 reset in 122 ms.
Product exploration explored 100000 steps with 22948 reset in 127 ms.
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 11:51:41] [INFO ] Invariant cache hit.
[2024-05-21 11:51:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 11:51:41] [INFO ] Invariant cache hit.
[2024-05-21 11:51:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 11:51:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 11:51:41] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-21 11:51:41] [INFO ] Invariant cache hit.
[2024-05-21 11:51:41] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/219 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:51:43] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:51:43] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:43] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 11:51:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/219 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 126/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 271 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 10187ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10383 ms. Remains : 92/92 places, 127/127 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-08 finished in 34009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 109 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 109 transition count 164
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 109 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 99 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 99 transition count 144
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 99 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 92 transition count 121
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 92 transition count 121
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 127 place count 92 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 89 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 89 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 88 transition count 109
Applied a total of 137 rules in 17 ms. Remains 88 /144 variables (removed 56) and now considering 109/256 (removed 147) transitions.
// Phase 1: matrix 109 rows 88 cols
[2024-05-21 11:51:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:51:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 11:51:51] [INFO ] Invariant cache hit.
[2024-05-21 11:51:51] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:51:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 11:51:51] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 11:51:51] [INFO ] Invariant cache hit.
[2024-05-21 11:51:51] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3981 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 5997ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 109/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6203 ms. Remains : 88/144 places, 109/256 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-09 finished in 6260 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) U !p1)&&(p2||X((p3||G(p4)))))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 125 transition count 195
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 115 transition count 182
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 115 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 115 transition count 178
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 107 transition count 167
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 107 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 107 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 102 transition count 153
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 102 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 102 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 99 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 99 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 99 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 98 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 98 transition count 144
Applied a total of 112 rules in 10 ms. Remains 98 /144 variables (removed 46) and now considering 144/256 (removed 112) transitions.
// Phase 1: matrix 144 rows 98 cols
[2024-05-21 11:51:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:51:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:51:57] [INFO ] Invariant cache hit.
[2024-05-21 11:51:57] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 11:51:58] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-21 11:51:58] [INFO ] Invariant cache hit.
[2024-05-21 11:51:58] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/242 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 59/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 159 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/242 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 59/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 143/302 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 302 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 8820ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 8823ms
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 144/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9033 ms. Remains : 98/144 places, 144/256 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR p1 (AND (NOT p2) (NOT p3) (NOT p4))), (OR p1 (AND (NOT p2) (NOT p3) (NOT p4))), p0, p1, (AND (NOT p4) (NOT p3)), true, (NOT p4)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-10 finished in 9351 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||(p1&&X(G(p2))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
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 122 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 110 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 110 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 110 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 100 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 100 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 100 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 94 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 94 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 91 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 118
Applied a total of 127 rules in 11 ms. Remains 90 /144 variables (removed 54) and now considering 118/256 (removed 138) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-21 11:52:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:52:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:52:07] [INFO ] Invariant cache hit.
[2024-05-21 11:52:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:52:07] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 11:52:07] [INFO ] Invariant cache hit.
[2024-05-21 11:52:07] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/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, 41/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 117 unsolved in 1990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 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, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/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, 41/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 250 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6256ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6257ms
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 118/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6440 ms. Remains : 90/144 places, 118/256 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-12
Product exploration explored 100000 steps with 22921 reset in 133 ms.
Product exploration explored 100000 steps with 22879 reset in 141 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 (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND p0 p2) (AND p1 p2))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (9108 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1935 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1884 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 25271 steps, run visited all 5 properties in 99 ms. (steps per millisecond=255 )
Probabilistic random walk after 25271 steps, saw 11782 distinct states, run finished after 99 ms. (steps per millisecond=255 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND p0 p2) (AND p1 p2))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR p0 p1) p2))), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 15 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-12 finished in 7419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
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 122 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 110 transition count 163
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 110 transition count 163
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 110 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 100 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 100 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 100 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 94 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 94 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 94 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 91 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 91 transition count 119
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 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 117
Applied a total of 127 rules in 12 ms. Remains 90 /144 variables (removed 54) and now considering 117/256 (removed 139) transitions.
// Phase 1: matrix 117 rows 90 cols
[2024-05-21 11:52:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:52:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:52:14] [INFO ] Invariant cache hit.
[2024-05-21 11:52:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:52:14] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:52:14] [INFO ] Invariant cache hit.
[2024-05-21 11:52:14] [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, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:52:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:52:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 11:52:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3148 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: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4131 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: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7366ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7368ms
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 117/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7558 ms. Remains : 90/144 places, 117/256 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-14
Product exploration explored 100000 steps with 22983 reset in 108 ms.
Product exploration explored 100000 steps with 23027 reset in 113 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 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), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9142 resets) in 72 ms. (547 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (1860 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-21 11:52:22] [INFO ] Invariant cache hit.
[2024-05-21 11:52:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 8 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9179 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 13 ms. (steps per millisecond=665 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 13 ms. (steps per millisecond=665 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 119 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 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:52:23] [INFO ] Invariant cache hit.
[2024-05-21 11:52:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:52:23] [INFO ] Invariant cache hit.
[2024-05-21 11:52:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:52:23] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 11:52:23] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 11:52:23] [INFO ] Invariant cache hit.
[2024-05-21 11:52:23] [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, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:52:24] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:52:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-21 11:52:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3130 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: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4324 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: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7542ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7543ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7738 ms. Remains : 90/90 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 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 :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9225 resets) in 89 ms. (444 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (1901 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-05-21 11:52:31] [INFO ] Invariant cache hit.
[2024-05-21 11:52:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 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: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 5 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9242 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1947 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 12 ms. (steps per millisecond=721 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 12 ms. (steps per millisecond=721 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 128 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 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22934 reset in 114 ms.
Product exploration explored 100000 steps with 23029 reset in 115 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:52:32] [INFO ] Invariant cache hit.
[2024-05-21 11:52:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 11:52:32] [INFO ] Invariant cache hit.
[2024-05-21 11:52:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:52:32] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 11:52:32] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 11:52:32] [INFO ] Invariant cache hit.
[2024-05-21 11:52:32] [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, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:52:33] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:52:33] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:52:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3022 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: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4122 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: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7234ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7236ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7433 ms. Remains : 90/90 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-14 finished in 24912 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 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 120 transition count 175
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 107 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 107 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 83 place count 107 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 93 place count 97 transition count 139
Iterating global reduction 2 with 10 rules applied. Total rules applied 103 place count 97 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 97 transition count 133
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 116 place count 90 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 90 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 90 transition count 114
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 86 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 86 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 106
Applied a total of 139 rules in 11 ms. Remains 85 /144 variables (removed 59) and now considering 106/256 (removed 150) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 11:52:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:52:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:52:39] [INFO ] Invariant cache hit.
[2024-05-21 11:52:39] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:52:39] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 11:52:39] [INFO ] Invariant cache hit.
[2024-05-21 11:52:39] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 105/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 226 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 5595ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5596ms
Starting structural reductions in LTL mode, iteration 1 : 85/144 places, 106/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5787 ms. Remains : 85/144 places, 106/256 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-15 finished in 6143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(F((!(p0 U p1)||G(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((p1||G(!p2)||X(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m07-LTLFireability-14
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
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 122 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 110 transition count 163
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 110 transition count 163
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 110 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 100 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 100 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 100 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 94 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 94 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 94 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 91 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 91 transition count 119
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 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 117
Applied a total of 127 rules in 18 ms. Remains 90 /144 variables (removed 54) and now considering 117/256 (removed 139) transitions.
// Phase 1: matrix 117 rows 90 cols
[2024-05-21 11:52:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:52:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:52:46] [INFO ] Invariant cache hit.
[2024-05-21 11:52:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:52:46] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:52:46] [INFO ] Invariant cache hit.
[2024-05-21 11:52:46] [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, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:52:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:52:48] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-21 11:52:48] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3019 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: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4229 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: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7338ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7339ms
Starting structural reductions in LI_LTL mode, iteration 1 : 90/144 places, 117/256 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7536 ms. Remains : 90/144 places, 117/256 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-14
Product exploration explored 100000 steps with 23027 reset in 105 ms.
Product exploration explored 100000 steps with 22903 reset in 114 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9224 resets) in 83 ms. (476 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (1844 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-05-21 11:52:54] [INFO ] Invariant cache hit.
[2024-05-21 11:52:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 10 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9174 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1944 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 12 ms. (steps per millisecond=721 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 12 ms. (steps per millisecond=721 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 128 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)), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:52:54] [INFO ] Invariant cache hit.
[2024-05-21 11:52:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:52:54] [INFO ] Invariant cache hit.
[2024-05-21 11:52:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:52:55] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 11:52:55] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 11:52:55] [INFO ] Invariant cache hit.
[2024-05-21 11:52:55] [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, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:52:56] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 11:52:56] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:52:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3131 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: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4323 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: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7542ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7543ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7744 ms. Remains : 90/90 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 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 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9093 resets) in 83 ms. (476 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-21 11:53:02] [INFO ] Invariant cache hit.
[2024-05-21 11:53:02] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 7 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9131 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1867 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 12 ms. (steps per millisecond=721 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 12 ms. (steps per millisecond=721 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 143 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 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22895 reset in 112 ms.
Product exploration explored 100000 steps with 22904 reset in 115 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:53:03] [INFO ] Invariant cache hit.
[2024-05-21 11:53:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:53:03] [INFO ] Invariant cache hit.
[2024-05-21 11:53:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:53:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 11:53:03] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 11:53:03] [INFO ] Invariant cache hit.
[2024-05-21 11:53:03] [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, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:53:05] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:53:05] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:53:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3204 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: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4394 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: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7688ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7884 ms. Remains : 90/90 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-14 finished in 25497 ms.
[2024-05-21 11:53:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 11:53:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 11:53:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 256 transitions and 1006 arcs took 3 ms.
Total runtime 249450 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 144
TRANSITIONS: 256
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.001s]


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


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

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

Process ID: 1959
MODEL NAME: /home/mcc/execution/410/model
144 places, 256 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-01 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-03 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-08 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716292840718

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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