About the Execution of ITS-Tools for DBSingleClientW-PT-d2m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2513.512 | 470336.00 | 627040.00 | 1285.50 | FFTTTTFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189500564.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 itstools
Input is DBSingleClientW-PT-d2m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500564
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-d2m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716326996217
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 21:29:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:29:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:29:57] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-21 21:29:57] [INFO ] Transformed 4763 places.
[2024-05-21 21:29:57] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:29:57] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 307 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 2 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 369 places :
Symmetric choice reduction at 1 with 369 rule applications. Total rules 614 place count 768 transition count 1495
Iterating global reduction 1 with 369 rules applied. Total rules applied 983 place count 768 transition count 1495
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 1046 place count 768 transition count 1432
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1340 place count 474 transition count 1138
Iterating global reduction 2 with 294 rules applied. Total rules applied 1634 place count 474 transition count 1138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1640 place count 474 transition count 1132
Discarding 217 places :
Symmetric choice reduction at 3 with 217 rule applications. Total rules 1857 place count 257 transition count 827
Iterating global reduction 3 with 217 rules applied. Total rules applied 2074 place count 257 transition count 827
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 3 with 276 rules applied. Total rules applied 2350 place count 257 transition count 551
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2366 place count 241 transition count 528
Iterating global reduction 4 with 16 rules applied. Total rules applied 2382 place count 241 transition count 528
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2396 place count 241 transition count 514
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2406 place count 231 transition count 504
Iterating global reduction 5 with 10 rules applied. Total rules applied 2416 place count 231 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2418 place count 231 transition count 502
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2426 place count 223 transition count 494
Iterating global reduction 6 with 8 rules applied. Total rules applied 2434 place count 223 transition count 494
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2446 place count 223 transition count 482
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2448 place count 221 transition count 478
Iterating global reduction 7 with 2 rules applied. Total rules applied 2450 place count 221 transition count 478
Applied a total of 2450 rules in 213 ms. Remains 221 /1183 variables (removed 962) and now considering 478/2478 (removed 2000) transitions.
// Phase 1: matrix 478 rows 221 cols
[2024-05-21 21:29:58] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 21:29:58] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 21:29:58] [INFO ] Invariant cache hit.
[2024-05-21 21:29:58] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-21 21:29:59] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-21 21:29:59] [INFO ] Invariant cache hit.
[2024-05-21 21:29:59] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 478/699 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 268/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (OVERLAPS) 0/699 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 491 constraints, problems are : Problem set: 0 solved, 477 unsolved in 26015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 221/221 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 478/699 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 268/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 477/968 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 968 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 221/221 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 57497ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 57590ms
Starting structural reductions in LTL mode, iteration 1 : 221/1183 places, 478/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58905 ms. Remains : 221/1183 places, 478/2478 transitions.
Support contains 35 out of 221 places after structural reductions.
[2024-05-21 21:30:56] [INFO ] Flatten gal took : 58 ms
[2024-05-21 21:30:56] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:30:57] [INFO ] Input system was already deterministic with 478 transitions.
Support contains 33 out of 221 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 29
RANDOM walk for 40000 steps (9193 resets) in 2199 ms. (18 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (175 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (373 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (375 resets) in 52 ms. (75 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (162 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (185 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (175 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (156 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (168 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (187 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (187 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (175 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (166 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (172 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (177 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (173 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (169 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (409 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (190 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (181 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (352 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (179 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (155 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (200 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (192 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (174 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (197 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (176 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (158 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 631882 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :27 out of 29
Probabilistic random walk after 631882 steps, saw 252119 distinct states, run finished after 3004 ms. (steps per millisecond=210 ) properties seen :27
[2024-05-21 21:31:00] [INFO ] Invariant cache hit.
[2024-05-21 21:31:00] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/85 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/136 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/377 variables, 136/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 31/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 691/699 variables, and 250 constraints, problems are : Problem set: 2 solved, 0 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/221 constraints, ReadFeed: 31/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 36 stable transitions
Graph (complete) has 917 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 310
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 171 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 150 transition count 252
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 150 transition count 252
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 150 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 178 place count 138 transition count 205
Iterating global reduction 3 with 12 rules applied. Total rules applied 190 place count 138 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 138 transition count 200
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 201 place count 132 transition count 194
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 132 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 132 transition count 193
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 212 place count 128 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 128 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 128 transition count 186
Applied a total of 219 rules in 51 ms. Remains 128 /221 variables (removed 93) and now considering 186/478 (removed 292) transitions.
// Phase 1: matrix 186 rows 128 cols
[2024-05-21 21:31:01] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:31:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:31:01] [INFO ] Invariant cache hit.
[2024-05-21 21:31:01] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:31:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-21 21:31:01] [INFO ] Redundant transitions in 5 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 21:31:01] [INFO ] Invariant cache hit.
[2024-05-21 21:31:01] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/314 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 21:31:05] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 11 ms to minimize.
[2024-05-21 21:31:05] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 194 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/314 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 62/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 185/379 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 379 constraints, problems are : Problem set: 0 solved, 185 unsolved in 11694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
After SMT, in 18642ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 18644ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/221 places, 186/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18992 ms. Remains : 128/221 places, 186/478 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-00 finished in 19212 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)||X((p1 U p2))))||X(G(p1))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 349
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 344
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 173 transition count 317
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 173 transition count 317
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 113 place count 173 transition count 305
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 153 transition count 263
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 153 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 162 place count 153 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 141 transition count 222
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 141 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 141 transition count 216
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 198 place count 135 transition count 210
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 135 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 135 transition count 209
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 209 place count 131 transition count 205
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 131 transition count 202
Applied a total of 216 rules in 22 ms. Remains 131 /221 variables (removed 90) and now considering 202/478 (removed 276) transitions.
// Phase 1: matrix 202 rows 131 cols
[2024-05-21 21:31:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:31:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:31:20] [INFO ] Invariant cache hit.
[2024-05-21 21:31:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:31:21] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 21:31:21] [INFO ] Invariant cache hit.
[2024-05-21 21:31:21] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/333 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 79/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 212 constraints, problems are : Problem set: 0 solved, 201 unsolved in 6874 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/333 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 79/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 201/413 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/333 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 413 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 18859ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 18862ms
Starting structural reductions in LTL mode, iteration 1 : 131/221 places, 202/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19190 ms. Remains : 131/221 places, 202/478 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01
Product exploration explored 100000 steps with 29717 reset in 284 ms.
Product exploration explored 100000 steps with 29860 reset in 221 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 484 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 116 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (9179 resets) in 352 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1799 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1769 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1820 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 284 ms. (140 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1773 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1727 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1751 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1767 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1782 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1999662 steps, run timeout after 3001 ms. (steps per millisecond=666 ) properties seen :8 out of 9
Probabilistic random walk after 1999662 steps, saw 818191 distinct states, run finished after 3001 ms. (steps per millisecond=666 ) properties seen :8
[2024-05-21 21:31:44] [INFO ] Invariant cache hit.
[2024-05-21 21:31:44] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/229 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 327/333 variables, and 149 constraints, problems are : Problem set: 1 solved, 0 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/131 constraints, ReadFeed: 19/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1)))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p1)))
Knowledge based reduction with 23 factoid took 122 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 24345 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))||(p1 U X(p2))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 351
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 175 transition count 326
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 175 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 109 place count 175 transition count 314
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 129 place count 155 transition count 266
Iterating global reduction 2 with 20 rules applied. Total rules applied 149 place count 155 transition count 266
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 158 place count 155 transition count 257
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 168 place count 145 transition count 229
Iterating global reduction 3 with 10 rules applied. Total rules applied 178 place count 145 transition count 229
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 188 place count 145 transition count 219
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 142 transition count 216
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 142 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 142 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 141 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 141 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 199 place count 141 transition count 212
Applied a total of 199 rules in 23 ms. Remains 141 /221 variables (removed 80) and now considering 212/478 (removed 266) transitions.
// Phase 1: matrix 212 rows 141 cols
[2024-05-21 21:31:45] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 21:31:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 21:31:45] [INFO ] Invariant cache hit.
[2024-05-21 21:31:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:31:45] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-21 21:31:45] [INFO ] Invariant cache hit.
[2024-05-21 21:31:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/353 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 74/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 217 constraints, problems are : Problem set: 0 solved, 211 unsolved in 6906 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/353 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 74/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 211/428 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 428 constraints, problems are : Problem set: 0 solved, 211 unsolved in 15850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 23064ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 23066ms
Starting structural reductions in LTL mode, iteration 1 : 141/221 places, 212/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23528 ms. Remains : 141/221 places, 212/478 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 518 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 21 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-03 finished in 24327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 351
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 175 transition count 326
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 175 transition count 326
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 108 place count 175 transition count 315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 156 transition count 270
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 156 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 156 transition count 263
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 145 transition count 226
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 145 transition count 226
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 186 place count 145 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 191 place count 140 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 140 transition count 210
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 136 transition count 206
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 136 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 207 place count 136 transition count 203
Applied a total of 207 rules in 21 ms. Remains 136 /221 variables (removed 85) and now considering 203/478 (removed 275) transitions.
// Phase 1: matrix 203 rows 136 cols
[2024-05-21 21:32:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:32:09] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
[2024-05-21 21:32:09] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:32:09] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
[2024-05-21 21:32:09] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 19639ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 19642ms
Starting structural reductions in LTL mode, iteration 1 : 136/221 places, 203/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20011 ms. Remains : 136/221 places, 203/478 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 10460 steps with 2418 reset in 23 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-06 finished in 20132 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 U (G(p1)||(p1&&G(!p2))))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 196 transition count 367
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 196 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 196 transition count 361
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 176 transition count 336
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 176 transition count 336
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 176 transition count 326
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 125 place count 157 transition count 281
Iterating global reduction 2 with 19 rules applied. Total rules applied 144 place count 157 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 154 place count 157 transition count 271
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 165 place count 146 transition count 235
Iterating global reduction 3 with 11 rules applied. Total rules applied 176 place count 146 transition count 235
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 184 place count 146 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 188 place count 142 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 192 place count 142 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 142 transition count 222
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 195 place count 140 transition count 220
Iterating global reduction 5 with 2 rules applied. Total rules applied 197 place count 140 transition count 220
Applied a total of 197 rules in 49 ms. Remains 140 /221 variables (removed 81) and now considering 220/478 (removed 258) transitions.
// Phase 1: matrix 220 rows 140 cols
[2024-05-21 21:32:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:32:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:32:29] [INFO ] Invariant cache hit.
[2024-05-21 21:32:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 21:32:29] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-21 21:32:29] [INFO ] Redundant transitions in 19 ms returned []
Running 219 sub problems to find dead transitions.
[2024-05-21 21:32:29] [INFO ] Invariant cache hit.
[2024-05-21 21:32:29] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/360 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 85/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 227 constraints, problems are : Problem set: 0 solved, 219 unsolved in 6295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/360 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 85/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 219/446 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 446 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 21706ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 21708ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/221 places, 220/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22126 ms. Remains : 140/221 places, 220/478 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-07
Product exploration explored 100000 steps with 22988 reset in 232 ms.
Product exploration explored 100000 steps with 23115 reset in 210 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 520 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 139 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9181 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1774 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7678 steps, run visited all 1 properties in 19 ms. (steps per millisecond=404 )
Probabilistic random walk after 7678 steps, saw 3553 distinct states, run finished after 22 ms. (steps per millisecond=349 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 39 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-07 finished in 23307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 337
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 337
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 194 transition count 332
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 80 place count 173 transition count 307
Iterating global reduction 1 with 21 rules applied. Total rules applied 101 place count 173 transition count 307
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 173 transition count 297
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 132 place count 152 transition count 255
Iterating global reduction 2 with 21 rules applied. Total rules applied 153 place count 152 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 162 place count 152 transition count 246
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 140 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 140 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 140 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 198 place count 134 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 134 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 134 transition count 201
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 209 place count 130 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 130 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 130 transition count 194
Applied a total of 216 rules in 15 ms. Remains 130 /221 variables (removed 91) and now considering 194/478 (removed 284) transitions.
// Phase 1: matrix 194 rows 130 cols
[2024-05-21 21:32:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:32:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:32:52] [INFO ] Invariant cache hit.
[2024-05-21 21:32:52] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:32:53] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 21:32:53] [INFO ] Invariant cache hit.
[2024-05-21 21:32:53] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/324 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 202 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/324 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 193/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 395 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 19876ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 19878ms
Starting structural reductions in LTL mode, iteration 1 : 130/221 places, 194/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20212 ms. Remains : 130/221 places, 194/478 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 20407 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(G(p0))||(F(G(p1)) U p2))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 195 transition count 350
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 173 transition count 327
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 173 transition count 327
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 117 place count 173 transition count 312
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 152 transition count 263
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 152 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 152 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 180 place count 140 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 140 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 140 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 202 place count 134 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 208 place count 134 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 134 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 130 transition count 200
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 130 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 220 place count 130 transition count 197
Applied a total of 220 rules in 18 ms. Remains 130 /221 variables (removed 91) and now considering 197/478 (removed 281) transitions.
// Phase 1: matrix 197 rows 130 cols
[2024-05-21 21:33:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:33:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 21:33:13] [INFO ] Invariant cache hit.
[2024-05-21 21:33:13] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-21 21:33:13] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-21 21:33:13] [INFO ] Invariant cache hit.
[2024-05-21 21:33:13] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/327 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 69/201 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 21:33:16] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:33:17] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 203 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8913 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/327 variables, 130/134 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 69/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 196/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 399 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints]
After SMT, in 21913ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 21915ms
Starting structural reductions in LTL mode, iteration 1 : 130/221 places, 197/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22252 ms. Remains : 130/221 places, 197/478 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-09 finished in 22470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p0 U p1)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 344
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 194 transition count 340
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 172 transition count 313
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 172 transition count 313
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 114 place count 172 transition count 301
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 134 place count 152 transition count 261
Iterating global reduction 2 with 20 rules applied. Total rules applied 154 place count 152 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 162 place count 152 transition count 253
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 140 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 140 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 196 place count 140 transition count 204
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 201 place count 135 transition count 199
Iterating global reduction 4 with 5 rules applied. Total rules applied 206 place count 135 transition count 199
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 210 place count 131 transition count 195
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 131 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 217 place count 131 transition count 192
Applied a total of 217 rules in 24 ms. Remains 131 /221 variables (removed 90) and now considering 192/478 (removed 286) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-21 21:33:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:33:35] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:33:35] [INFO ] Invariant cache hit.
[2024-05-21 21:33:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:33:36] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-21 21:33:36] [INFO ] Redundant transitions in 3 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 21:33:36] [INFO ] Invariant cache hit.
[2024-05-21 21:33:36] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17047ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/221 places, 192/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17397 ms. Remains : 131/221 places, 192/478 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10
Product exploration explored 100000 steps with 22951 reset in 161 ms.
Product exploration explored 100000 steps with 22959 reset in 226 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 120 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (9232 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1807 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1800 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1775 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1748 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1781 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 23631 steps, run visited all 5 properties in 176 ms. (steps per millisecond=134 )
Probabilistic random walk after 23631 steps, saw 11486 distinct states, run finished after 176 ms. (steps per millisecond=134 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 11 factoid took 245 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 21:33:54] [INFO ] Invariant cache hit.
[2024-05-21 21:33:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:33:54] [INFO ] Invariant cache hit.
[2024-05-21 21:33:54] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:33:54] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-21 21:33:54] [INFO ] Redundant transitions in 3 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 21:33:54] [INFO ] Invariant cache hit.
[2024-05-21 21:33:54] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5198 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17024ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17027ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17369 ms. Remains : 131/131 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 94 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9260 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1776 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1728 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1759 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1845 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1844 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 23631 steps, run visited all 5 properties in 161 ms. (steps per millisecond=146 )
Probabilistic random walk after 23631 steps, saw 11486 distinct states, run finished after 162 ms. (steps per millisecond=145 ) properties seen :5
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 242 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22923 reset in 217 ms.
Product exploration explored 100000 steps with 22970 reset in 172 ms.
Built C files in :
/tmp/ltsmin208654753416184735
[2024-05-21 21:34:13] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2024-05-21 21:34:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:13] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2024-05-21 21:34:13] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:13] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
[2024-05-21 21:34:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:13] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin208654753416184735
Running compilation step : cd /tmp/ltsmin208654753416184735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin208654753416184735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin208654753416184735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11442741609189207443.hoa' '--buchi-type=spotba'
LTSmin run took 413 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 38978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!(X(p0) U p1)&&!p2) U (G(p2)&&p3)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 353
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 353
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 195 transition count 347
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 174 transition count 321
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 174 transition count 321
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 113 place count 174 transition count 308
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 154 transition count 261
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 154 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 160 place count 154 transition count 254
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 171 place count 143 transition count 222
Iterating global reduction 3 with 11 rules applied. Total rules applied 182 place count 143 transition count 222
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 192 place count 143 transition count 212
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 197 place count 138 transition count 207
Iterating global reduction 4 with 5 rules applied. Total rules applied 202 place count 138 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 138 transition count 206
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 207 place count 134 transition count 202
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 134 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 213 place count 134 transition count 200
Applied a total of 213 rules in 21 ms. Remains 134 /221 variables (removed 87) and now considering 200/478 (removed 278) transitions.
// Phase 1: matrix 200 rows 134 cols
[2024-05-21 21:34:14] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:34:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:34:14] [INFO ] Invariant cache hit.
[2024-05-21 21:34:14] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:34:15] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 21:34:15] [INFO ] Redundant transitions in 1 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-21 21:34:15] [INFO ] Invariant cache hit.
[2024-05-21 21:34:15] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/334 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 210 constraints, problems are : Problem set: 0 solved, 199 unsolved in 5537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/334 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 199/409 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 409 constraints, problems are : Problem set: 0 solved, 199 unsolved in 13150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 18922ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 18923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/221 places, 200/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19277 ms. Remains : 134/221 places, 200/478 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p2), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-11
Stuttering criterion allowed to conclude after 32 steps with 11 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-11 finished in 19426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 292
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 243
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 150 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 138 transition count 202
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 138 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 196
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 190
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 128 transition count 185
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 128 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 128 transition count 182
Applied a total of 221 rules in 16 ms. Remains 128 /221 variables (removed 93) and now considering 182/478 (removed 296) transitions.
// Phase 1: matrix 182 rows 128 cols
[2024-05-21 21:34:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:34:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:34:34] [INFO ] Invariant cache hit.
[2024-05-21 21:34:34] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:34:34] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-21 21:34:34] [INFO ] Invariant cache hit.
[2024-05-21 21:34:34] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 191 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 181/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 372 constraints, problems are : Problem set: 0 solved, 181 unsolved in 13405 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 20076ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 20077ms
Starting structural reductions in LTL mode, iteration 1 : 128/221 places, 182/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20401 ms. Remains : 128/221 places, 182/478 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-12
Product exploration explored 100000 steps with 22938 reset in 141 ms.
Product exploration explored 100000 steps with 23079 reset in 141 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9201 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1809 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42541 steps, run visited all 1 properties in 61 ms. (steps per millisecond=697 )
Probabilistic random walk after 42541 steps, saw 19880 distinct states, run finished after 62 ms. (steps per millisecond=686 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-12 finished in 21140 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 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 310
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 249
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 249
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 150 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 180 place count 138 transition count 202
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 138 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 198 place count 138 transition count 196
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 203 place count 133 transition count 191
Iterating global reduction 4 with 5 rules applied. Total rules applied 208 place count 133 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 133 transition count 190
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 212 place count 130 transition count 187
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 130 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 130 transition count 186
Applied a total of 216 rules in 28 ms. Remains 130 /221 variables (removed 91) and now considering 186/478 (removed 292) transitions.
// Phase 1: matrix 186 rows 130 cols
[2024-05-21 21:34:55] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:34:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:34:55] [INFO ] Invariant cache hit.
[2024-05-21 21:34:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:34:55] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-21 21:34:55] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 21:34:55] [INFO ] Invariant cache hit.
[2024-05-21 21:34:55] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 19366ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/221 places, 186/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19716 ms. Remains : 130/221 places, 186/478 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-13
Product exploration explored 100000 steps with 22943 reset in 136 ms.
Product exploration explored 100000 steps with 22999 reset in 148 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9226 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1773 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 34 ms. (steps per millisecond=656 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 34 ms. (steps per millisecond=656 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 186/186 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-21 21:35:15] [INFO ] Invariant cache hit.
[2024-05-21 21:35:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:35:15] [INFO ] Invariant cache hit.
[2024-05-21 21:35:15] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:35:16] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 21:35:16] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 21:35:16] [INFO ] Invariant cache hit.
[2024-05-21 21:35:16] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 19686ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19687ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19997 ms. Remains : 130/130 places, 186/186 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9212 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 42 ms. (steps per millisecond=531 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 42 ms. (steps per millisecond=531 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22906 reset in 129 ms.
Product exploration explored 100000 steps with 22907 reset in 135 ms.
Built C files in :
/tmp/ltsmin14837640622032035450
[2024-05-21 21:35:36] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2024-05-21 21:35:36] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:35:36] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2024-05-21 21:35:36] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:35:36] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2024-05-21 21:35:36] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:35:36] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14837640622032035450
Running compilation step : cd /tmp/ltsmin14837640622032035450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin14837640622032035450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14837640622032035450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11577120110494457327.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-21 21:35:51] [INFO ] Invariant cache hit.
[2024-05-21 21:35:51] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:35:51] [INFO ] Invariant cache hit.
[2024-05-21 21:35:51] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:35:52] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 21:35:52] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 21:35:52] [INFO ] Invariant cache hit.
[2024-05-21 21:35:52] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14326 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 19332ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19652 ms. Remains : 130/130 places, 186/186 transitions.
Built C files in :
/tmp/ltsmin6037853275587593483
[2024-05-21 21:36:11] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2024-05-21 21:36:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:36:11] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2024-05-21 21:36:11] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:36:11] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2024-05-21 21:36:11] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:36:11] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6037853275587593483
Running compilation step : cd /tmp/ltsmin6037853275587593483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin6037853275587593483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6037853275587593483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15447252147220506840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:36:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:36:26] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:36:26] [INFO ] Time to serialize gal into /tmp/LTL1676777824054808605.gal : 2 ms
[2024-05-21 21:36:26] [INFO ] Time to serialize properties into /tmp/LTL11846675423106944716.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1676777824054808605.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9454401743780810324.hoa' '-atoms' '/tmp/LTL11846675423106944716.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11846675423106944716.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9454401743780810324.hoa
Detected timeout of ITS tools.
[2024-05-21 21:36:41] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:36:41] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:36:41] [INFO ] Time to serialize gal into /tmp/LTL5267643454367991974.gal : 2 ms
[2024-05-21 21:36:41] [INFO ] Time to serialize properties into /tmp/LTL3630704870541988310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5267643454367991974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3630704870541988310.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l4281<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4281<1))"
Detected timeout of ITS tools.
[2024-05-21 21:36:56] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:36:56] [INFO ] Applying decomposition
[2024-05-21 21:36:56] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8335509616067275582.txt' '-o' '/tmp/graph8335509616067275582.bin' '-w' '/tmp/graph8335509616067275582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8335509616067275582.bin' '-l' '-1' '-v' '-w' '/tmp/graph8335509616067275582.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:36:56] [INFO ] Decomposing Gal with order
[2024-05-21 21:36:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:36:56] [INFO ] Removed a total of 221 redundant transitions.
[2024-05-21 21:36:56] [INFO ] Flatten gal took : 47 ms
[2024-05-21 21:36:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 10 ms.
[2024-05-21 21:36:56] [INFO ] Time to serialize gal into /tmp/LTL16691335848624802723.gal : 4 ms
[2024-05-21 21:36:56] [INFO ] Time to serialize properties into /tmp/LTL12051822404002053377.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16691335848624802723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12051822404002053377.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u0.s1<1)||(i5.u20.l4281<1))"))))
Formula 0 simplified : FG!"((i2.u0.s1<1)||(i5.u20.l4281<1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t13, t14, t91, t93, t94, t95, t105, t146, t147, t150, t151, t222, t228, t332, t365, t366,...600
Computing Next relation with stutter on 2.35132e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
764 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.67324,196440,1,0,206875,80902,2134,831358,745,536990,695518
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-13 finished in 130379 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)&&p0)) U p2)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 343
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 194 transition count 341
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 172 transition count 314
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 172 transition count 314
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 172 transition count 302
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 132 place count 152 transition count 264
Iterating global reduction 2 with 20 rules applied. Total rules applied 152 place count 152 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 152 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 141 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 141 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 141 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 198 place count 136 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 203 place count 136 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 136 transition count 209
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 207 place count 133 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 133 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 133 transition count 204
Applied a total of 212 rules in 16 ms. Remains 133 /221 variables (removed 88) and now considering 204/478 (removed 274) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-21 21:37:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:37:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:37:05] [INFO ] Invariant cache hit.
[2024-05-21 21:37:05] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:37:05] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 21:37:05] [INFO ] Invariant cache hit.
[2024-05-21 21:37:05] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 21:37:09] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 215 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/337 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 79/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 203/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 418 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 21957ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21960ms
Starting structural reductions in LTL mode, iteration 1 : 133/221 places, 204/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22300 ms. Remains : 133/221 places, 204/478 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-14 finished in 22504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 292
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 243
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 150 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 138 transition count 203
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 138 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 197
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 191
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 190
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 128 transition count 186
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 128 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 128 transition count 183
Applied a total of 221 rules in 21 ms. Remains 128 /221 variables (removed 93) and now considering 183/478 (removed 295) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 21:37:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:37:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:37:28] [INFO ] Invariant cache hit.
[2024-05-21 21:37:28] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:37:28] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 21:37:28] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 21:37:28] [INFO ] Invariant cache hit.
[2024-05-21 21:37:28] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 18016ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/221 places, 183/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18343 ms. Remains : 128/221 places, 183/478 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-15 finished in 18399 ms.
All properties solved by simple procedures.
Total runtime 469241 ms.
BK_STOP 1716327466553
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-d2m06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d2m06, 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 r092-tall-171624189500564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m06.tgz
mv DBSingleClientW-PT-d2m06 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 '
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 ;