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-171624189600572.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-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189600572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 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-d2m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716327984230

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-d2m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 21:46:25] [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:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:46:25] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-21 21:46:25] [INFO ] Transformed 4763 places.
[2024-05-21 21:46:25] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:46:25] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 41 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 368 places :
Symmetric choice reduction at 1 with 368 rule applications. Total rules 613 place count 769 transition count 1412
Iterating global reduction 1 with 368 rules applied. Total rules applied 981 place count 769 transition count 1412
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1026 place count 769 transition count 1367
Discarding 293 places :
Symmetric choice reduction at 2 with 293 rule applications. Total rules 1319 place count 476 transition count 1074
Iterating global reduction 2 with 293 rules applied. Total rules applied 1612 place count 476 transition count 1074
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1617 place count 476 transition count 1069
Discarding 211 places :
Symmetric choice reduction at 3 with 211 rule applications. Total rules 1828 place count 265 transition count 773
Iterating global reduction 3 with 211 rules applied. Total rules applied 2039 place count 265 transition count 773
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 3 with 240 rules applied. Total rules applied 2279 place count 265 transition count 533
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2292 place count 252 transition count 512
Iterating global reduction 4 with 13 rules applied. Total rules applied 2305 place count 252 transition count 512
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2315 place count 242 transition count 502
Iterating global reduction 4 with 10 rules applied. Total rules applied 2325 place count 242 transition count 502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2329 place count 242 transition count 498
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2336 place count 235 transition count 491
Iterating global reduction 5 with 7 rules applied. Total rules applied 2343 place count 235 transition count 491
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2354 place count 235 transition count 480
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2355 place count 234 transition count 473
Iterating global reduction 6 with 1 rules applied. Total rules applied 2356 place count 234 transition count 473
Applied a total of 2356 rules in 202 ms. Remains 234 /1183 variables (removed 949) and now considering 473/2478 (removed 2005) transitions.
// Phase 1: matrix 473 rows 234 cols
[2024-05-21 21:46:26] [INFO ] Computed 2 invariants in 26 ms
[2024-05-21 21:46:26] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-21 21:46:26] [INFO ] Invariant cache hit.
[2024-05-21 21:46:26] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-05-21 21:46:27] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-21 21:46:27] [INFO ] Invariant cache hit.
[2024-05-21 21:46:27] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 473/707 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 254/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (OVERLAPS) 0/707 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 490 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 473/707 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 254/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 472/962 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/707 variables, and 962 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61654ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61681ms
Starting structural reductions in LTL mode, iteration 1 : 234/1183 places, 473/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63052 ms. Remains : 234/1183 places, 473/2478 transitions.
Support contains 41 out of 234 places after structural reductions.
[2024-05-21 21:47:29] [INFO ] Flatten gal took : 57 ms
[2024-05-21 21:47:29] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:47:29] [INFO ] Input system was already deterministic with 473 transitions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (9218 resets) in 2408 ms. (16 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4003 steps (178 resets) in 70 ms. (56 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (188 resets) in 67 ms. (58 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (189 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (203 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (162 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (190 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (173 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (181 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (188 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (157 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (171 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (383 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (408 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (178 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (171 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (174 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (179 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (174 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (191 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (174 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (182 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (400 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (180 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (200 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (215 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (185 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (182 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (190 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (158 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (188 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (165 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (370 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (360 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (166 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 882738 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :33 out of 34
Probabilistic random walk after 882738 steps, saw 345446 distinct states, run finished after 3008 ms. (steps per millisecond=293 ) properties seen :33
[2024-05-21 21:47:33] [INFO ] Invariant cache hit.
[2024-05-21 21:47:33] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 86/707 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/234 constraints, ReadFeed: 0/254 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 37 stable transitions
Graph (complete) has 940 edges and 234 vertex of which 233 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 200 transition count 331
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 103 place count 175 transition count 301
Iterating global reduction 1 with 25 rules applied. Total rules applied 128 place count 175 transition count 301
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 136 place count 175 transition count 293
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 159 place count 152 transition count 256
Iterating global reduction 2 with 23 rules applied. Total rules applied 182 place count 152 transition count 256
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 195 place count 152 transition count 243
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 139 transition count 208
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 139 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 139 transition count 204
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 132 transition count 197
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 132 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 242 place count 132 transition count 194
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 246 place count 128 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 128 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 128 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 127 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 127 transition count 186
Applied a total of 253 rules in 54 ms. Remains 127 /234 variables (removed 107) and now considering 186/473 (removed 287) transitions.
// Phase 1: matrix 186 rows 127 cols
[2024-05-21 21:47:34] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:47:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:47:34] [INFO ] Invariant cache hit.
[2024-05-21 21:47:34] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:47:34] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-21 21:47:34] [INFO ] Redundant transitions in 5 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 21:47:34] [INFO ] Invariant cache hit.
[2024-05-21 21:47:34] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/313 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 195 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4830 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 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/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/313 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 380 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 17396ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 17399ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/234 places, 186/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17805 ms. Remains : 127/234 places, 186/473 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 18107 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 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 347
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 200 transition count 336
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 104 place count 175 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 129 place count 175 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 137 place count 175 transition count 294
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 159 place count 153 transition count 258
Iterating global reduction 2 with 22 rules applied. Total rules applied 181 place count 153 transition count 258
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 194 place count 153 transition count 245
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 207 place count 140 transition count 207
Iterating global reduction 3 with 13 rules applied. Total rules applied 220 place count 140 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 224 place count 140 transition count 203
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 230 place count 134 transition count 197
Iterating global reduction 4 with 6 rules applied. Total rules applied 236 place count 134 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 239 place count 134 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 242 place count 131 transition count 190
Iterating global reduction 5 with 3 rules applied. Total rules applied 245 place count 131 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 247 place count 130 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 130 transition count 187
Applied a total of 248 rules in 63 ms. Remains 130 /234 variables (removed 104) and now considering 187/473 (removed 286) transitions.
// Phase 1: matrix 187 rows 130 cols
[2024-05-21 21:47:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:47:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:47:52] [INFO ] Invariant cache hit.
[2024-05-21 21:47:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:47:52] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-21 21:47:52] [INFO ] Redundant transitions in 8 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-21 21:47:52] [INFO ] Invariant cache hit.
[2024-05-21 21:47: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, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4607 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: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11735 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: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16577ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/234 places, 187/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16966 ms. Remains : 130/234 places, 187/473 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-01
Product exploration explored 100000 steps with 22987 reset in 245 ms.
Product exploration explored 100000 steps with 23058 reset in 194 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 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 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9223 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1799 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16977 steps, run visited all 1 properties in 105 ms. (steps per millisecond=161 )
Probabilistic random walk after 16977 steps, saw 7979 distinct states, run finished after 108 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 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, 187/187 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-21 21:48:10] [INFO ] Invariant cache hit.
[2024-05-21 21:48:10] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 21:48:10] [INFO ] Invariant cache hit.
[2024-05-21 21:48:10] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:48:10] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-21 21:48:10] [INFO ] Redundant transitions in 8 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-21 21:48:10] [INFO ] Invariant cache hit.
[2024-05-21 21:48:10] [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, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4605 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: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11538 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: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16400ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16745 ms. Remains : 130/130 places, 187/187 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 84 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9137 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1733 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16977 steps, run visited all 1 properties in 33 ms. (steps per millisecond=514 )
Probabilistic random walk after 16977 steps, saw 7979 distinct states, run finished after 34 ms. (steps per millisecond=499 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23058 reset in 142 ms.
Product exploration explored 100000 steps with 22906 reset in 141 ms.
Built C files in :
/tmp/ltsmin7874253152270342272
[2024-05-21 21:48:27] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-21 21:48:27] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:48:27] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-21 21:48:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:48:27] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-21 21:48:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:48:27] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7874253152270342272
Running compilation step : cd /tmp/ltsmin7874253152270342272;'/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 709 ms.
Running link step : cd /tmp/ltsmin7874253152270342272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7874253152270342272;'/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/stateBased4123710742239489487.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, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-21 21:48:43] [INFO ] Invariant cache hit.
[2024-05-21 21:48:43] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:48:43] [INFO ] Invariant cache hit.
[2024-05-21 21:48:43] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:48:43] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 21:48:43] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-21 21:48:43] [INFO ] Invariant cache hit.
[2024-05-21 21:48:43] [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, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4477 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: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11947 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: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16651ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16979 ms. Remains : 130/130 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin8072666119138579917
[2024-05-21 21:49:00] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-21 21:49:00] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:49:00] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-21 21:49:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:49:00] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-21 21:49:00] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:49:00] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8072666119138579917
Running compilation step : cd /tmp/ltsmin8072666119138579917;'/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 448 ms.
Running link step : cd /tmp/ltsmin8072666119138579917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8072666119138579917;'/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/stateBased9155514746310189866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:49:15] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:49:15] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:49:15] [INFO ] Time to serialize gal into /tmp/LTL2582995098496068749.gal : 3 ms
[2024-05-21 21:49:15] [INFO ] Time to serialize properties into /tmp/LTL15791165700424508845.prop : 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/LTL2582995098496068749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6616145030056900061.hoa' '-atoms' '/tmp/LTL15791165700424508845.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/LTL15791165700424508845.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6616145030056900061.hoa
Detected timeout of ITS tools.
[2024-05-21 21:49:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:49:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:49:30] [INFO ] Time to serialize gal into /tmp/LTL1365409452180479571.gal : 2 ms
[2024-05-21 21:49:30] [INFO ] Time to serialize properties into /tmp/LTL8161405710348127388.ltl : 2 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/LTL1365409452180479571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8161405710348127388.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)||(l4144<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4144<1))"
Detected timeout of ITS tools.
[2024-05-21 21:49:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:49:45] [INFO ] Applying decomposition
[2024-05-21 21:49:45] [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/graph13163714257963425399.txt' '-o' '/tmp/graph13163714257963425399.bin' '-w' '/tmp/graph13163714257963425399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13163714257963425399.bin' '-l' '-1' '-v' '-w' '/tmp/graph13163714257963425399.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:49:45] [INFO ] Decomposing Gal with order
[2024-05-21 21:49:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:49:45] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-21 21:49:45] [INFO ] Flatten gal took : 68 ms
[2024-05-21 21:49:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 14 ms.
[2024-05-21 21:49:45] [INFO ] Time to serialize gal into /tmp/LTL3368397654287729072.gal : 4 ms
[2024-05-21 21:49:45] [INFO ] Time to serialize properties into /tmp/LTL9882679525480331909.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/LTL3368397654287729072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9882679525480331909.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u2.s1<1)||(i2.u5.l4144<1))"))))
Formula 0 simplified : FG!"((i0.u2.s1<1)||(i2.u5.l4144<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-01 finished in 128591 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||X((X(X(G(p2)))&&p1)))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 349
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 349
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 75 place count 202 transition count 338
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 98 place count 179 transition count 306
Iterating global reduction 1 with 23 rules applied. Total rules applied 121 place count 179 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 128 place count 179 transition count 299
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 159 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 159 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 179 place count 159 transition count 256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 190 place count 148 transition count 230
Iterating global reduction 3 with 11 rules applied. Total rules applied 201 place count 148 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 204 place count 148 transition count 227
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 211 place count 141 transition count 220
Iterating global reduction 4 with 7 rules applied. Total rules applied 218 place count 141 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 141 transition count 217
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 225 place count 137 transition count 212
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 137 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 137 transition count 211
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 136 transition count 209
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 136 transition count 209
Applied a total of 232 rules in 16 ms. Remains 136 /234 variables (removed 98) and now considering 209/473 (removed 264) transitions.
// Phase 1: matrix 209 rows 136 cols
[2024-05-21 21:50:00] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:50:00] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 21:50:00] [INFO ] Invariant cache hit.
[2024-05-21 21:50:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 21:50:01] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-21 21:50:01] [INFO ] Invariant cache hit.
[2024-05-21 21:50:01] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/345 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 219 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/345 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 208/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 427 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19826ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19827ms
Starting structural reductions in LTL mode, iteration 1 : 136/234 places, 209/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20203 ms. Remains : 136/234 places, 209/473 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-02 finished in 20458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 200 transition count 331
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 104 place count 174 transition count 296
Iterating global reduction 1 with 26 rules applied. Total rules applied 130 place count 174 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 174 transition count 288
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 161 place count 151 transition count 251
Iterating global reduction 2 with 23 rules applied. Total rules applied 184 place count 151 transition count 251
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 197 place count 151 transition count 238
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 210 place count 138 transition count 203
Iterating global reduction 3 with 13 rules applied. Total rules applied 223 place count 138 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 138 transition count 199
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 234 place count 131 transition count 192
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 131 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 244 place count 131 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 248 place count 127 transition count 184
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 127 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 127 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 126 transition count 181
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 126 transition count 181
Applied a total of 255 rules in 18 ms. Remains 126 /234 variables (removed 108) and now considering 181/473 (removed 292) transitions.
// Phase 1: matrix 181 rows 126 cols
[2024-05-21 21:50:21] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:50:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:50:21] [INFO ] Invariant cache hit.
[2024-05-21 21:50:21] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:50:21] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-21 21:50:21] [INFO ] Invariant cache hit.
[2024-05-21 21:50:21] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/307 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 21:50:24] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 190 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/307 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 180/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 370 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
After SMT, in 20141ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 20144ms
Starting structural reductions in LTL mode, iteration 1 : 126/234 places, 181/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20470 ms. Remains : 126/234 places, 181/473 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 20614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)&&p0))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 356
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 356
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 345
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 312
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 177 transition count 305
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 156 transition count 271
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 156 transition count 271
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 156 transition count 257
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 200 place count 144 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 212 place count 144 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 218 place count 144 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 138 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 138 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 231 place count 138 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 235 place count 134 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 239 place count 134 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 134 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 133 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 133 transition count 196
Applied a total of 242 rules in 20 ms. Remains 133 /234 variables (removed 101) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 133 cols
[2024-05-21 21:50:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:50:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:50:41] [INFO ] Invariant cache hit.
[2024-05-21 21:50:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 21:50:42] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 21:50:42] [INFO ] Invariant cache hit.
[2024-05-21 21:50:42] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/329 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 203 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/329 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 195/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 398 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 17715ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 17719ms
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18056 ms. Remains : 133/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 18223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 347
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 200 transition count 336
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 104 place count 175 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 129 place count 175 transition count 302
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 136 place count 175 transition count 295
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 153 transition count 259
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 153 transition count 259
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 193 place count 153 transition count 246
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 206 place count 140 transition count 205
Iterating global reduction 3 with 13 rules applied. Total rules applied 219 place count 140 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 222 place count 140 transition count 202
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 229 place count 133 transition count 195
Iterating global reduction 4 with 7 rules applied. Total rules applied 236 place count 133 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 239 place count 133 transition count 192
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 243 place count 129 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 129 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 248 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 128 transition count 184
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 128 transition count 184
Applied a total of 250 rules in 17 ms. Remains 128 /234 variables (removed 106) and now considering 184/473 (removed 289) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-21 21:50:59] [INFO ] Computed 2 invariants in 8 ms
[2024-05-21 21:51:00] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 21:51:00] [INFO ] Invariant cache hit.
[2024-05-21 21:51:00] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:51:00] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-21 21:51:00] [INFO ] Invariant cache hit.
[2024-05-21 21:51:00] [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, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 21:51:01] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/312 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 193 constraints, problems are : Problem set: 0 solved, 183 unsolved in 5791 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: 183/183 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/312 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 183/376 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 376 constraints, problems are : Problem set: 0 solved, 183 unsolved in 12408 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: 183/183 constraints, Known Traps: 1/1 constraints]
After SMT, in 18412ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 18413ms
Starting structural reductions in LTL mode, iteration 1 : 128/234 places, 184/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18737 ms. Remains : 128/234 places, 184/473 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-05
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-05 finished in 18850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&p0)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 353
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 353
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 80 place count 201 transition count 339
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 105 place count 176 transition count 305
Iterating global reduction 1 with 25 rules applied. Total rules applied 130 place count 176 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 176 transition count 297
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 160 place count 154 transition count 261
Iterating global reduction 2 with 22 rules applied. Total rules applied 182 place count 154 transition count 261
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 195 place count 154 transition count 248
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 141 transition count 213
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 141 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 141 transition count 209
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 134 transition count 202
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 134 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 242 place count 134 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 246 place count 130 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 130 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 130 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 129 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 129 transition count 191
Applied a total of 253 rules in 18 ms. Remains 129 /234 variables (removed 105) and now considering 191/473 (removed 282) transitions.
// Phase 1: matrix 191 rows 129 cols
[2024-05-21 21:51:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:51:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 21:51:18] [INFO ] Invariant cache hit.
[2024-05-21 21:51:18] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:51:19] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-21 21:51:19] [INFO ] Invariant cache hit.
[2024-05-21 21:51:19] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/320 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 201 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/320 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 190/391 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 391 constraints, problems are : Problem set: 0 solved, 190 unsolved in 11119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 17808ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 17812ms
Starting structural reductions in LTL mode, iteration 1 : 129/234 places, 191/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18161 ms. Remains : 129/234 places, 191/473 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 18324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1) U G((p1 U !p2)))||X(p2)||p0)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 202 transition count 333
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 97 place count 179 transition count 305
Iterating global reduction 1 with 23 rules applied. Total rules applied 120 place count 179 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 179 transition count 297
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 159 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 159 transition count 267
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 180 place count 159 transition count 255
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 192 place count 147 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 147 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 208 place count 147 transition count 210
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 213 place count 142 transition count 205
Iterating global reduction 4 with 5 rules applied. Total rules applied 218 place count 142 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 142 transition count 202
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 223 place count 140 transition count 200
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 140 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 140 transition count 199
Applied a total of 226 rules in 16 ms. Remains 140 /234 variables (removed 94) and now considering 199/473 (removed 274) transitions.
// Phase 1: matrix 199 rows 140 cols
[2024-05-21 21:51:37] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:51:37] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 21:51:37] [INFO ] Invariant cache hit.
[2024-05-21 21:51:37] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:51:37] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 21:51:37] [INFO ] Invariant cache hit.
[2024-05-21 21:51:37] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/339 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 62/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 204 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5845 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/339 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 62/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 198/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 402 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 20254ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20257ms
Starting structural reductions in LTL mode, iteration 1 : 140/234 places, 199/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20669 ms. Remains : 140/234 places, 199/473 transitions.
Stuttering acceptance computed with spot in 337 ms :[false, false, false, (AND (NOT p1) (NOT p2)), p2, (NOT p1), p2]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 501 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 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 56 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 21559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&G(!p1)) U (G((!p0&&G(!p1)))||p2)))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 351
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 351
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 202 transition count 341
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 178 transition count 308
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 178 transition count 308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 130 place count 178 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 157 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 157 transition count 266
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 185 place count 157 transition count 253
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 196 place count 146 transition count 227
Iterating global reduction 3 with 11 rules applied. Total rules applied 207 place count 146 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 215 place count 146 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 221 place count 140 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 140 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 140 transition count 211
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 233 place count 136 transition count 206
Iterating global reduction 5 with 4 rules applied. Total rules applied 237 place count 136 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 136 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 239 place count 135 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 135 transition count 203
Applied a total of 240 rules in 25 ms. Remains 135 /234 variables (removed 99) and now considering 203/473 (removed 270) transitions.
// Phase 1: matrix 203 rows 135 cols
[2024-05-21 21:51:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:51:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 21:51:58] [INFO ] Invariant cache hit.
[2024-05-21 21:51:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-21 21:51:59] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-21 21:51:59] [INFO ] Redundant transitions in 3 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 21:51:59] [INFO ] Invariant cache hit.
[2024-05-21 21:51:59] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 213 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 76/76 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/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 202/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 415 constraints, problems are : Problem set: 0 solved, 202 unsolved in 13768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 19929ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 19932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/234 places, 203/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20376 ms. Remains : 135/234 places, 203/473 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08
Product exploration explored 100000 steps with 23001 reset in 260 ms.
Product exploration explored 100000 steps with 22933 reset in 236 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 edges and 135 vertex of which 134 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) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, p1]
RANDOM walk for 40000 steps (9162 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1805 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1849 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1699 resets) in 391 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1758 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1771 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 23672 steps, run visited all 5 properties in 119 ms. (steps per millisecond=198 )
Probabilistic random walk after 23672 steps, saw 11687 distinct states, run finished after 119 ms. (steps per millisecond=198 ) properties seen :5
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 21916 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(F(!p0)) U G(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 348
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 338
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 304
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 176 transition count 298
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 154 place count 154 transition count 263
Iterating global reduction 2 with 22 rules applied. Total rules applied 176 place count 154 transition count 263
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 189 place count 154 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 142 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 142 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 216 place count 142 transition count 214
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 223 place count 135 transition count 207
Iterating global reduction 4 with 7 rules applied. Total rules applied 230 place count 135 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 135 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 237 place count 131 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 241 place count 131 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 131 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 130 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 130 transition count 196
Applied a total of 244 rules in 16 ms. Remains 130 /234 variables (removed 104) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 130 cols
[2024-05-21 21:52:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:52:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:52:20] [INFO ] Invariant cache hit.
[2024-05-21 21:52:20] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 21:52:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 21:52:20] [INFO ] Invariant cache hit.
[2024-05-21 21:52:20] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/326 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 71/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 21:52:24] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 204 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/326 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 71/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 195/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/326 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 399 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
After SMT, in 23424ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23427ms
Starting structural reductions in LTL mode, iteration 1 : 130/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23780 ms. Remains : 130/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 23979 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(p1)&&X((F(p3)&&p2))&&p0)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 203 transition count 344
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 203 transition count 344
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 203 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 91 place count 181 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 113 place count 181 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 121 place count 181 transition count 302
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 141 place count 161 transition count 270
Iterating global reduction 2 with 20 rules applied. Total rules applied 161 place count 161 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 171 place count 161 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 182 place count 150 transition count 240
Iterating global reduction 3 with 11 rules applied. Total rules applied 193 place count 150 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 150 transition count 236
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 204 place count 143 transition count 229
Iterating global reduction 4 with 7 rules applied. Total rules applied 211 place count 143 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 143 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 218 place count 139 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 139 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 139 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 138 transition count 218
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 138 transition count 218
Applied a total of 225 rules in 22 ms. Remains 138 /234 variables (removed 96) and now considering 218/473 (removed 255) transitions.
// Phase 1: matrix 218 rows 138 cols
[2024-05-21 21:52:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:52:44] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:52:44] [INFO ] Invariant cache hit.
[2024-05-21 21:52:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 21:52:45] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-21 21:52:45] [INFO ] Invariant cache hit.
[2024-05-21 21:52:45] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/356 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 90/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/356 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 230 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/356 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 90/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 217/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 447 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 22671ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 22674ms
Starting structural reductions in LTL mode, iteration 1 : 138/234 places, 218/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23076 ms. Remains : 138/234 places, 218/473 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 23375 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(X(((!G((p1 U p2)) U !F(p1))||p0)))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 177 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 154 place count 156 transition count 264
Iterating global reduction 2 with 21 rules applied. Total rules applied 175 place count 156 transition count 264
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 189 place count 156 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 144 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 144 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 144 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 227 place count 138 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 138 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 138 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 240 place count 134 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 134 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 192
Applied a total of 246 rules in 18 ms. Remains 133 /234 variables (removed 101) and now considering 192/473 (removed 281) transitions.
// Phase 1: matrix 192 rows 133 cols
[2024-05-21 21:53:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:53:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 21:53:08] [INFO ] Invariant cache hit.
[2024-05-21 21:53:08] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:53:08] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-21 21:53:08] [INFO ] Invariant cache hit.
[2024-05-21 21:53:08] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 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/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12381 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17924ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17926ms
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 192/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18296 ms. Remains : 133/234 places, 192/473 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11
Product exploration explored 100000 steps with 22890 reset in 141 ms.
Product exploration explored 100000 steps with 22975 reset in 162 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (9148 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1783 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1821 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21803 steps, run visited all 3 properties in 100 ms. (steps per millisecond=218 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 100 ms. (steps per millisecond=218 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 21:53:27] [INFO ] Invariant cache hit.
[2024-05-21 21:53:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 21:53:28] [INFO ] Invariant cache hit.
[2024-05-21 21:53:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:53:28] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-21 21:53:28] [INFO ] Invariant cache hit.
[2024-05-21 21:53:28] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 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/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18255ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18257ms
Finished structural reductions in LTL mode , in 1 iterations and 18625 ms. Remains : 133/133 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (9183 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1803 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1694 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1799 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21803 steps, run visited all 3 properties in 86 ms. (steps per millisecond=253 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 86 ms. (steps per millisecond=253 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 23102 reset in 141 ms.
Product exploration explored 100000 steps with 23092 reset in 150 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 21:53:48] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 21:53:48] [INFO ] Invariant cache hit.
[2024-05-21 21:53:48] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 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/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12813 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18312ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18313ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18329 ms. Remains : 133/133 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin14741827024461019912
[2024-05-21 21:54:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14741827024461019912
Running compilation step : cd /tmp/ltsmin14741827024461019912;'/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 377 ms.
Running link step : cd /tmp/ltsmin14741827024461019912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14741827024461019912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8527813169621190454.hoa' '--buchi-type=spotba'
LTSmin run took 317 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 59822 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)||X((p1||G(F(p2)))))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 363
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 202 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 177 transition count 317
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 177 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 136 place count 177 transition count 307
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 155 transition count 271
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 155 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 155 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 143 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 143 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 143 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 137 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 238 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 134 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 204
Applied a total of 246 rules in 19 ms. Remains 133 /234 variables (removed 101) and now considering 204/473 (removed 269) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-21 21:54:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:54:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 21:54:07] [INFO ] Invariant cache hit.
[2024-05-21 21:54:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:54:08] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 21:54:08] [INFO ] Invariant cache hit.
[2024-05-21 21:54:08] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18824 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24719ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24721ms
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 204/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25119 ms. Remains : 133/234 places, 204/473 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12
Product exploration explored 100000 steps with 29763 reset in 158 ms.
Product exploration explored 100000 steps with 29813 reset in 163 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9257 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1762 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1793 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1795 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1793 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1817 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1775 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1816 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1725 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 265 ms. (steps per millisecond=278 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 277 ms. (steps per millisecond=266 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 428 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:54:35] [INFO ] Invariant cache hit.
[2024-05-21 21:54:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:54:35] [INFO ] Invariant cache hit.
[2024-05-21 21:54:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:54:35] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 21:54:35] [INFO ] Invariant cache hit.
[2024-05-21 21:54:35] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18825 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24549ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24551ms
Finished structural reductions in LTL mode , in 1 iterations and 24901 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9210 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1785 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1794 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1813 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1846 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1807 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1791 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 385 ms. (steps per millisecond=191 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 385 ms. (steps per millisecond=191 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 12 factoid took 418 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29806 reset in 172 ms.
Product exploration explored 100000 steps with 29783 reset in 175 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:55:03] [INFO ] Redundant transitions in 2 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-21 21:55:03] [INFO ] Invariant cache hit.
[2024-05-21 21:55:03] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18837 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24742ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24744ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24762 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin15749164814882729260
[2024-05-21 21:55:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15749164814882729260
Running compilation step : cd /tmp/ltsmin15749164814882729260;'/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 378 ms.
Running link step : cd /tmp/ltsmin15749164814882729260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15749164814882729260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased212765390408540273.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:55:42] [INFO ] Invariant cache hit.
[2024-05-21 21:55:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:55:42] [INFO ] Invariant cache hit.
[2024-05-21 21:55:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:55:43] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 21:55:43] [INFO ] Invariant cache hit.
[2024-05-21 21:55:43] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5519 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24509ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24513ms
Finished structural reductions in LTL mode , in 1 iterations and 24882 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin6175499259767863862
[2024-05-21 21:56:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6175499259767863862
Running compilation step : cd /tmp/ltsmin6175499259767863862;'/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 375 ms.
Running link step : cd /tmp/ltsmin6175499259767863862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6175499259767863862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3127215137509776491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:56:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:56:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:56:22] [INFO ] Time to serialize gal into /tmp/LTL1800737539324603350.gal : 2 ms
[2024-05-21 21:56:22] [INFO ] Time to serialize properties into /tmp/LTL9090528937739636747.prop : 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/LTL1800737539324603350.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13596320336985113902.hoa' '-atoms' '/tmp/LTL9090528937739636747.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/LTL9090528937739636747.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13596320336985113902.hoa
Detected timeout of ITS tools.
[2024-05-21 21:56:38] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:56:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:56:38] [INFO ] Time to serialize gal into /tmp/LTL11560951152939503432.gal : 2 ms
[2024-05-21 21:56:38] [INFO ] Time to serialize properties into /tmp/LTL11646166677825384177.ltl : 12 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/LTL11560951152939503432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11646166677825384177.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2024-05-21 21:56:53] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:56:53] [INFO ] Applying decomposition
[2024-05-21 21:56:53] [INFO ] Flatten gal took : 9 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/graph15196654022925647575.txt' '-o' '/tmp/graph15196654022925647575.bin' '-w' '/tmp/graph15196654022925647575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15196654022925647575.bin' '-l' '-1' '-v' '-w' '/tmp/graph15196654022925647575.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:56:53] [INFO ] Decomposing Gal with order
[2024-05-21 21:56:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:56:53] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-21 21:56:53] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:56:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 8 ms.
[2024-05-21 21:56:53] [INFO ] Time to serialize gal into /tmp/LTL567288019656748460.gal : 3 ms
[2024-05-21 21:56:53] [INFO ] Time to serialize properties into /tmp/LTL8887747980298368080.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/LTL567288019656748460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8887747980298368080.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...253
Read 1 LTL properties
Checking formula 0 : !((G((F("((i5.u2.s1>=1)&&(u0.l1667>=1))"))||(X(("((i5.u2.s1>=1)&&(u5.l4272>=1))")||(G(F("((i5.u2.s1<1)||(u0.l3092<1))"))))))))
Formula 0 simplified : F(G!"((i5.u2.s1>=1)&&(u0.l1667>=1))" & X(!"((i5.u2.s1>=1)&&(u5.l4272>=1))" & FG!"((i5.u2.s1<1)||(u0.l3092<1))"))
Reverse transition relation is NOT exact ! Due to transitions t5, t28, t115, t119, t120, t219, t235, t236, t347, t371, t383, t385, t392, t393, t395, t396, ...558
Computing Next relation with stutter on 1.67049e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 180502 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||G(p1)||X(F(p2))))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 343
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 333
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 299
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 134 place count 176 transition count 291
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 156 place count 154 transition count 255
Iterating global reduction 2 with 22 rules applied. Total rules applied 178 place count 154 transition count 255
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 190 place count 154 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 202 place count 142 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 214 place count 142 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 218 place count 142 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 136 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 136 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 136 transition count 202
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 236 place count 133 transition count 198
Iterating global reduction 5 with 3 rules applied. Total rules applied 239 place count 133 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 240 place count 132 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 132 transition count 196
Applied a total of 241 rules in 15 ms. Remains 132 /234 variables (removed 102) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 132 cols
[2024-05-21 21:57:08] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:57:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:57:08] [INFO ] Invariant cache hit.
[2024-05-21 21:57:08] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 21:57:08] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 21:57:08] [INFO ] Invariant cache hit.
[2024-05-21 21:57:08] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 20063ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 20066ms
Starting structural reductions in LTL mode, iteration 1 : 132/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20502 ms. Remains : 132/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-13
Product exploration explored 100000 steps with 23038 reset in 151 ms.
Product exploration explored 100000 steps with 23000 reset in 221 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9194 resets) in 220 ms. (180 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (1773 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1806 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
[2024-05-21 21:57:29] [INFO ] Invariant cache hit.
[2024-05-21 21:57:29] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 312 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 22 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9265 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 76 ms. (steps per millisecond=237 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 76 ms. (steps per millisecond=237 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 21:57:31] [INFO ] Invariant cache hit.
[2024-05-21 21:57:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 21:57:31] [INFO ] Invariant cache hit.
[2024-05-21 21:57:31] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 21:57:31] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 21:57:31] [INFO ] Invariant cache hit.
[2024-05-21 21:57:31] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14438 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 20154ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 20158ms
Finished structural reductions in LTL mode , in 1 iterations and 20586 ms. Remains : 132/132 places, 196/196 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 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 p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (9191 resets) in 271 ms. (147 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (1848 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1831 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-21 21:57:52] [INFO ] Invariant cache hit.
[2024-05-21 21:57:52] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 236 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 10 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9255 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1770 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1795 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 80 ms. (steps per millisecond=225 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 80 ms. (steps per millisecond=225 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 23011 reset in 158 ms.
Product exploration explored 100000 steps with 22898 reset in 166 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 21:57:54] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-21 21:57:54] [INFO ] Invariant cache hit.
[2024-05-21 21:57:54] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19763ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19765ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19797 ms. Remains : 132/132 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin11564978973455815010
[2024-05-21 21:58:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11564978973455815010
Running compilation step : cd /tmp/ltsmin11564978973455815010;'/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 377 ms.
Running link step : cd /tmp/ltsmin11564978973455815010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11564978973455815010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1975965111174376950.hoa' '--buchi-type=spotba'
LTSmin run took 274 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-13 finished in 66797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 177 transition count 299
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 156 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 156 transition count 266
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 156 transition count 252
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 201 place count 143 transition count 210
Iterating global reduction 3 with 13 rules applied. Total rules applied 214 place count 143 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 222 place count 143 transition count 202
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 228 place count 137 transition count 196
Iterating global reduction 4 with 6 rules applied. Total rules applied 234 place count 137 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 137 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 239 place count 133 transition count 190
Iterating global reduction 5 with 4 rules applied. Total rules applied 243 place count 133 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 133 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 245 place count 132 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 132 transition count 187
Applied a total of 246 rules in 26 ms. Remains 132 /234 variables (removed 102) and now considering 187/473 (removed 286) transitions.
// Phase 1: matrix 187 rows 132 cols
[2024-05-21 21:58:15] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:58:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:58:15] [INFO ] Invariant cache hit.
[2024-05-21 21:58:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:58:15] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 21:58:15] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-21 21:58:15] [INFO ] Invariant cache hit.
[2024-05-21 21:58:15] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/319 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 60/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 194 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/319 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 60/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 186/380 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 380 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16379ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16382ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/234 places, 187/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16743 ms. Remains : 132/234 places, 187/473 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 16847 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)))'
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)||X((p1||G(F(p2)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-12
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 363
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 202 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 177 transition count 317
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 177 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 136 place count 177 transition count 307
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 155 transition count 271
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 155 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 155 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 143 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 143 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 143 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 137 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 238 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 134 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 204
Applied a total of 246 rules in 22 ms. Remains 133 /234 variables (removed 101) and now considering 204/473 (removed 269) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-21 21:58:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:58:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:58:32] [INFO ] Invariant cache hit.
[2024-05-21 21:58:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:58:32] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 21:58:32] [INFO ] Invariant cache hit.
[2024-05-21 21:58:32] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5693 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18774 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24777ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24782ms
Starting structural reductions in LI_LTL mode, iteration 1 : 133/234 places, 204/473 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 25147 ms. Remains : 133/234 places, 204/473 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12
Product exploration explored 100000 steps with 29769 reset in 174 ms.
Product exploration explored 100000 steps with 29806 reset in 166 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 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 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 156 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9177 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1828 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1750 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1836 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1793 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1749 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1861 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1716 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 310 ms. (steps per millisecond=237 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 311 ms. (steps per millisecond=237 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 493 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:58:59] [INFO ] Invariant cache hit.
[2024-05-21 21:58:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:58:59] [INFO ] Invariant cache hit.
[2024-05-21 21:58:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:59:00] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 21:59:00] [INFO ] Invariant cache hit.
[2024-05-21 21:59:00] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 25031ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 25035ms
Finished structural reductions in LTL mode , in 1 iterations and 25381 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 190 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9200 resets) in 452 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1784 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1775 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1812 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1802 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1718 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1852 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1724 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1769 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 389 ms. (steps per millisecond=189 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 389 ms. (steps per millisecond=189 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 12 factoid took 421 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29765 reset in 160 ms.
Product exploration explored 100000 steps with 29796 reset in 181 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:59:27] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-21 21:59:27] [INFO ] Invariant cache hit.
[2024-05-21 21:59:27] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24270ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24296 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin9090368627462695139
[2024-05-21 21:59:52] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9090368627462695139
Running compilation step : cd /tmp/ltsmin9090368627462695139;'/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 398 ms.
Running link step : cd /tmp/ltsmin9090368627462695139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9090368627462695139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6038875667119795540.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 22:00:07] [INFO ] Invariant cache hit.
[2024-05-21 22:00:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 22:00:07] [INFO ] Invariant cache hit.
[2024-05-21 22:00:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 22:00:07] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 22:00:07] [INFO ] Invariant cache hit.
[2024-05-21 22:00:07] [INFO ] State equation strengthened by 78 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 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, 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, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18519 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24422ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24425ms
Finished structural reductions in LTL mode , in 1 iterations and 24908 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin1813584638791244193
[2024-05-21 22:00:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1813584638791244193
Running compilation step : cd /tmp/ltsmin1813584638791244193;'/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 361 ms.
Running link step : cd /tmp/ltsmin1813584638791244193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1813584638791244193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11983829825290901998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:00:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:00:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:00:47] [INFO ] Time to serialize gal into /tmp/LTL6522705844056819548.gal : 1 ms
[2024-05-21 22:00:47] [INFO ] Time to serialize properties into /tmp/LTL9527537715135309522.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/LTL6522705844056819548.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16346691446026658417.hoa' '-atoms' '/tmp/LTL9527537715135309522.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/LTL9527537715135309522.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16346691446026658417.hoa
Detected timeout of ITS tools.
[2024-05-21 22:01:02] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:01:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:01:02] [INFO ] Time to serialize gal into /tmp/LTL5466840701566846252.gal : 1 ms
[2024-05-21 22:01:02] [INFO ] Time to serialize properties into /tmp/LTL14657419838768251291.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/LTL5466840701566846252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14657419838768251291.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...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2024-05-21 22:01:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:01:17] [INFO ] Applying decomposition
[2024-05-21 22:01:17] [INFO ] Flatten gal took : 6 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/graph4392526682644303899.txt' '-o' '/tmp/graph4392526682644303899.bin' '-w' '/tmp/graph4392526682644303899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4392526682644303899.bin' '-l' '-1' '-v' '-w' '/tmp/graph4392526682644303899.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:01:17] [INFO ] Decomposing Gal with order
[2024-05-21 22:01:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:01:17] [INFO ] Removed a total of 223 redundant transitions.
[2024-05-21 22:01:17] [INFO ] Flatten gal took : 19 ms
[2024-05-21 22:01:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 7 ms.
[2024-05-21 22:01:17] [INFO ] Time to serialize gal into /tmp/LTL1371033975735342288.gal : 2 ms
[2024-05-21 22:01:17] [INFO ] Time to serialize properties into /tmp/LTL5521990295171781442.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/LTL1371033975735342288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5521990295171781442.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...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.i1.u0.s1>=1)&&(i0.i1.u0.l1667>=1))"))||(X(("((i0.i1.u0.s1>=1)&&(i1.u20.l4272>=1))")||(G(F("((i0.i1.u0.s1<1)||(u7.l3092<1...166
Formula 0 simplified : F(G!"((i0.i1.u0.s1>=1)&&(i0.i1.u0.l1667>=1))" & X(!"((i0.i1.u0.s1>=1)&&(i1.u20.l4272>=1))" & FG!"((i0.i1.u0.s1<1)||(u7.l3092<1))"))
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t13, t113, t119, t120, t132, t207, t236, t347, t365, t384, t385, t392, t393, t394, t3...611
Computing Next relation with stutter on 1.67049e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 180651 ms.
[2024-05-21 22:01:32] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16315680544701948647
[2024-05-21 22:01:32] [INFO ] Computing symmetric may disable matrix : 473 transitions.
[2024-05-21 22:01:32] [INFO ] Applying decomposition
[2024-05-21 22:01:32] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:01:32] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:01:32] [INFO ] Computing symmetric may enable matrix : 473 transitions.
[2024-05-21 22:01:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:01:32] [INFO ] Computing Do-Not-Accords matrix : 473 transitions.
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/graph1747004476741549531.txt' '-o' '/tmp/graph1747004476741549531.bin' '-w' '/tmp/graph1747004476741549531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1747004476741549531.bin' '-l' '-1' '-v' '-w' '/tmp/graph1747004476741549531.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:01:32] [INFO ] Decomposing Gal with order
[2024-05-21 22:01:32] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:01:32] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16315680544701948647
Running compilation step : cd /tmp/ltsmin16315680544701948647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
[2024-05-21 22:01:32] [INFO ] Removed a total of 503 redundant transitions.
[2024-05-21 22:01:32] [INFO ] Flatten gal took : 65 ms
[2024-05-21 22:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 580 labels/synchronizations in 13 ms.
[2024-05-21 22:01:32] [INFO ] Time to serialize gal into /tmp/LTLFireability17385944819893298831.gal : 4 ms
[2024-05-21 22:01:32] [INFO ] Time to serialize properties into /tmp/LTLFireability10792556401950964232.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/LTLFireability17385944819893298831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10792556401950964232.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...278
Read 2 LTL properties
Checking formula 0 : !((G(F("((i3.i0.u2.s1<1)||(i0.u1.l4144<1))"))))
Formula 0 simplified : FG!"((i3.i0.u2.s1<1)||(i0.u1.l4144<1))"
Compilation finished in 1367 ms.
Running link step : cd /tmp/ltsmin16315680544701948647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16315680544701948647;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16315680544701948647;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16315680544701948647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t5, t29, t33, t42, t43, t45, t114, t120, t121, t130, t132, t133, t141, t143, t145, t149, t156...1362
Computing Next relation with stutter on 2.42134e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 22:26:35] [INFO ] Flatten gal took : 54 ms
[2024-05-21 22:26:35] [INFO ] Time to serialize gal into /tmp/LTLFireability12273181691876689128.gal : 10 ms
[2024-05-21 22:26:35] [INFO ] Time to serialize properties into /tmp/LTLFireability4950546899669351339.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/LTLFireability12273181691876689128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4950546899669351339.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...298
Read 2 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l4144<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4144<1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16315680544701948647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin16315680544701948647;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
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-d2m07"
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-d2m07, 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-171624189600572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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