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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716320314159

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-d1m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 19:38:35] [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 19:38:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:38:35] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-21 19:38:35] [INFO ] Transformed 1440 places.
[2024-05-21 19:38:35] [INFO ] Transformed 672 transitions.
[2024-05-21 19:38:35] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 412
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 412
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 269 place count 246 transition count 404
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 330 place count 185 transition count 343
Iterating global reduction 2 with 61 rules applied. Total rules applied 391 place count 185 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 393 place count 185 transition count 341
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 423 place count 155 transition count 297
Iterating global reduction 3 with 30 rules applied. Total rules applied 453 place count 155 transition count 297
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 480 place count 155 transition count 270
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 485 place count 150 transition count 263
Iterating global reduction 4 with 5 rules applied. Total rules applied 490 place count 150 transition count 263
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 493 place count 147 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 496 place count 147 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 498 place count 145 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 500 place count 145 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 501 place count 144 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 144 transition count 256
Applied a total of 502 rules in 106 ms. Remains 144 /347 variables (removed 203) and now considering 256/672 (removed 416) transitions.
// Phase 1: matrix 256 rows 144 cols
[2024-05-21 19:38:35] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 19:38:36] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 19:38:36] [INFO ] Invariant cache hit.
[2024-05-21 19:38:36] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-21 19:38:36] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 19:38:36] [INFO ] Invariant cache hit.
[2024-05-21 19:38:36] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/400 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 122/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 268 constraints, problems are : Problem set: 0 solved, 255 unsolved in 9165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/400 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 122/268 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 255/523 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 523 constraints, problems are : Problem set: 0 solved, 255 unsolved in 18550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
After SMT, in 28287ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 28319ms
Starting structural reductions in LTL mode, iteration 1 : 144/347 places, 256/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29149 ms. Remains : 144/347 places, 256/672 transitions.
Support contains 31 out of 144 places after structural reductions.
[2024-05-21 19:39:05] [INFO ] Flatten gal took : 43 ms
[2024-05-21 19:39:05] [INFO ] Flatten gal took : 18 ms
[2024-05-21 19:39:05] [INFO ] Input system was already deterministic with 256 transitions.
Support contains 29 out of 144 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (9186 resets) in 2412 ms. (16 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 95 ms. (41 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (193 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (393 resets) in 51 ms. (76 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (185 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (190 resets) in 53 ms. (74 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (183 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (179 resets) in 53 ms. (74 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (180 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (428 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (175 resets) in 51 ms. (76 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (198 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (428 resets) in 82 ms. (48 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (180 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (179 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (371 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (192 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (180 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (212 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (189 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (177 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (173 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (179 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (172 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (161 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (185 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 101330 steps, run visited all 26 properties in 489 ms. (steps per millisecond=207 )
Probabilistic random walk after 101330 steps, saw 40497 distinct states, run finished after 493 ms. (steps per millisecond=205 ) properties seen :26
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 545 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(F((!(p0 U p1)||G(!p0)))))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 122 transition count 184
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 109 transition count 168
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 109 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 109 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 91 place count 98 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 102 place count 98 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 98 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 116 place count 90 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 90 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 90 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 132 place count 86 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 139 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 85 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 85 transition count 110
Applied a total of 141 rules in 26 ms. Remains 85 /144 variables (removed 59) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 85 cols
[2024-05-21 19:39:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:39:07] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 19:39:07] [INFO ] Invariant cache hit.
[2024-05-21 19:39:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:39:07] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-21 19:39:07] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:39:07] [INFO ] Invariant cache hit.
[2024-05-21 19:39:07] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:39:09] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 8 ms to minimize.
[2024-05-21 19:39:09] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/195 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 109/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7395ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7396ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7790 ms. Remains : 85/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-00
Product exploration explored 100000 steps with 23025 reset in 208 ms.
Product exploration explored 100000 steps with 22887 reset in 162 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 198 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (9180 resets) in 855 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1889 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1930 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (6153 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 3009515 steps, run timeout after 3001 ms. (steps per millisecond=1002 ) properties seen :4 out of 5
Probabilistic random walk after 3009515 steps, saw 1189402 distinct states, run finished after 3003 ms. (steps per millisecond=1002 ) properties seen :4
[2024-05-21 19:39:19] [INFO ] Invariant cache hit.
[2024-05-21 19:39:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 34/195 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/85 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 246 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 85 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 19:39:19] [INFO ] Invariant cache hit.
[2024-05-21 19:39:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 19:39:19] [INFO ] Invariant cache hit.
[2024-05-21 19:39:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:39:20] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-21 19:39:20] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:39:20] [INFO ] Invariant cache hit.
[2024-05-21 19:39:20] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:39:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 6 ms to minimize.
[2024-05-21 19:39:21] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/195 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 109/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7244ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7246ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7538 ms. Remains : 85/85 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (9138 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (6134 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2636954 steps, run timeout after 3001 ms. (steps per millisecond=878 ) properties seen :4 out of 5
Probabilistic random walk after 2636954 steps, saw 1035054 distinct states, run finished after 3001 ms. (steps per millisecond=878 ) properties seen :4
[2024-05-21 19:39:30] [INFO ] Invariant cache hit.
[2024-05-21 19:39:30] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 34/195 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/85 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 257 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 78 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 22940 reset in 104 ms.
Product exploration explored 100000 steps with 22982 reset in 100 ms.
Built C files in :
/tmp/ltsmin138566413266695061
[2024-05-21 19:39:31] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 19:39:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:39:31] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 19:39:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:39:31] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 19:39:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:39:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin138566413266695061
Running compilation step : cd /tmp/ltsmin138566413266695061;'/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 405 ms.
Running link step : cd /tmp/ltsmin138566413266695061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 139 ms.
Running LTSmin : cd /tmp/ltsmin138566413266695061;'/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/stateBased1693327505570434339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 25 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 19:39:46] [INFO ] Invariant cache hit.
[2024-05-21 19:39:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 19:39:46] [INFO ] Invariant cache hit.
[2024-05-21 19:39:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:39:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-21 19:39:47] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:39:47] [INFO ] Invariant cache hit.
[2024-05-21 19:39:47] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:39:48] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:39:48] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/195 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 109/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7029ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7247 ms. Remains : 85/85 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin49754779878093588
[2024-05-21 19:39:54] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 19:39:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:39:54] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 19:39:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:39:54] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 19:39:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:39:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin49754779878093588
Running compilation step : cd /tmp/ltsmin49754779878093588;'/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 255 ms.
Running link step : cd /tmp/ltsmin49754779878093588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin49754779878093588;'/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/stateBased8729812131123920782.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:40:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:40:09] [INFO ] Flatten gal took : 23 ms
[2024-05-21 19:40:09] [INFO ] Time to serialize gal into /tmp/LTL5787871304786848416.gal : 3 ms
[2024-05-21 19:40:09] [INFO ] Time to serialize properties into /tmp/LTL2135607018513519060.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/LTL5787871304786848416.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12810227909778445658.hoa' '-atoms' '/tmp/LTL2135607018513519060.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/LTL2135607018513519060.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12810227909778445658.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t49, t57, t67, t68, t69, t71, t73, t74, t75, t76, t170, t200, t201, t20...431
Computing Next relation with stutter on 1.72112e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
1245 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.4788,290420,1,0,240,970750,264,116,3217,995956,402
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-00 finished in 75957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 121 transition count 176
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 108 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 108 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 108 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 98 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 98 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 98 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 91 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 91 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 91 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 108
Applied a total of 136 rules in 21 ms. Remains 86 /144 variables (removed 58) and now considering 108/256 (removed 148) transitions.
// Phase 1: matrix 108 rows 86 cols
[2024-05-21 19:40:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:40:23] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 19:40:23] [INFO ] Invariant cache hit.
[2024-05-21 19:40:23] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:40:23] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 19:40:23] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 19:40:23] [INFO ] Invariant cache hit.
[2024-05-21 19:40:23] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 5937ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5938ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/144 places, 108/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6256 ms. Remains : 86/144 places, 108/256 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-01
Product exploration explored 100000 steps with 23021 reset in 163 ms.
Product exploration explored 100000 steps with 22915 reset in 96 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9226 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4037 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16094 steps, run visited all 1 properties in 21 ms. (steps per millisecond=766 )
Probabilistic random walk after 16094 steps, saw 7657 distinct states, run finished after 21 ms. (steps per millisecond=766 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 19:40:30] [INFO ] Invariant cache hit.
[2024-05-21 19:40:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 19:40:30] [INFO ] Invariant cache hit.
[2024-05-21 19:40:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:40:30] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 19:40:30] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 19:40:30] [INFO ] Invariant cache hit.
[2024-05-21 19:40:30] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3903 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 5850ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5851ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6062 ms. Remains : 86/86 places, 108/108 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9226 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3999 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16094 steps, run visited all 1 properties in 23 ms. (steps per millisecond=699 )
Probabilistic random walk after 16094 steps, saw 7657 distinct states, run finished after 23 ms. (steps per millisecond=699 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22991 reset in 93 ms.
Product exploration explored 100000 steps with 23023 reset in 102 ms.
Built C files in :
/tmp/ltsmin12098872136786476892
[2024-05-21 19:40:37] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-21 19:40:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:40:37] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-21 19:40:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:40:37] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-21 19:40:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:40:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12098872136786476892
Running compilation step : cd /tmp/ltsmin12098872136786476892;'/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 292 ms.
Running link step : cd /tmp/ltsmin12098872136786476892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12098872136786476892;'/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/stateBased12819330611429595680.hoa' '--buchi-type=spotba'
LTSmin run took 13080 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-01 finished in 27442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 109 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 109 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 109 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 99 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 99 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 99 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 92 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 92 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 92 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 89 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 89 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 88 transition count 110
Applied a total of 136 rules in 39 ms. Remains 88 /144 variables (removed 56) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 19:40:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:40:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:40:50] [INFO ] Invariant cache hit.
[2024-05-21 19:40:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:40:50] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 19:40:50] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:40:50] [INFO ] Invariant cache hit.
[2024-05-21 19:40:50] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1869 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6060ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6061ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6291 ms. Remains : 88/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-03
Product exploration explored 100000 steps with 23034 reset in 101 ms.
Product exploration explored 100000 steps with 22879 reset in 102 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9239 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 25 ms. (steps per millisecond=698 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 25 ms. (steps per millisecond=698 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 10 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 19:40:57] [INFO ] Invariant cache hit.
[2024-05-21 19:40:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:40:57] [INFO ] Invariant cache hit.
[2024-05-21 19:40:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:40:57] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 19:40:57] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:40:57] [INFO ] Invariant cache hit.
[2024-05-21 19:40:57] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 5995ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5997ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6190 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9216 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 23 ms. (steps per millisecond=759 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 23 ms. (steps per millisecond=759 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22962 reset in 91 ms.
Product exploration explored 100000 steps with 23016 reset in 104 ms.
Built C files in :
/tmp/ltsmin8656478305368071738
[2024-05-21 19:41:04] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 19:41:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:41:04] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 19:41:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:41:04] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 19:41:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:41:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8656478305368071738
Running compilation step : cd /tmp/ltsmin8656478305368071738;'/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 286 ms.
Running link step : cd /tmp/ltsmin8656478305368071738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8656478305368071738;'/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/stateBased15597381898306238750.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 19:41:19] [INFO ] Invariant cache hit.
[2024-05-21 19:41:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 19:41:19] [INFO ] Invariant cache hit.
[2024-05-21 19:41:19] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:41:19] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-21 19:41:19] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:41:19] [INFO ] Invariant cache hit.
[2024-05-21 19:41:19] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6084ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6286 ms. Remains : 88/88 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin17433189316862877065
[2024-05-21 19:41:25] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 19:41:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:41:25] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 19:41:25] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:41:25] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 19:41:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:41:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17433189316862877065
Running compilation step : cd /tmp/ltsmin17433189316862877065;'/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 282 ms.
Running link step : cd /tmp/ltsmin17433189316862877065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17433189316862877065;'/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/stateBased4318056158821065600.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:41:41] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:41:41] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:41:41] [INFO ] Time to serialize gal into /tmp/LTL14966627600208979315.gal : 2 ms
[2024-05-21 19:41:41] [INFO ] Time to serialize properties into /tmp/LTL7554683495200847450.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/LTL14966627600208979315.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9584961384514161712.hoa' '-atoms' '/tmp/LTL7554683495200847450.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/LTL7554683495200847450.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9584961384514161712.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t49, t57, t67, t68, t91, t92, t98, t170, t200, t202, t206, t207, t208, ...422
Computing Next relation with stutter on 2.74477e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:41:56] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:41:56] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:41:56] [INFO ] Time to serialize gal into /tmp/LTL1940129332681568964.gal : 1 ms
[2024-05-21 19:41:56] [INFO ] Time to serialize properties into /tmp/LTL12142260239305283090.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/LTL1940129332681568964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12142260239305283090.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)||(l1216<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1216<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t49, t57, t67, t68, t91, t92, t98, t170, t200, t202, t206, t207, t208, ...422
Computing Next relation with stutter on 2.74477e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:42:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:42:11] [INFO ] Applying decomposition
[2024-05-21 19:42:11] [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/graph7862300333131798943.txt' '-o' '/tmp/graph7862300333131798943.bin' '-w' '/tmp/graph7862300333131798943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7862300333131798943.bin' '-l' '-1' '-v' '-w' '/tmp/graph7862300333131798943.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:42:11] [INFO ] Decomposing Gal with order
[2024-05-21 19:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:42:11] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-21 19:42:11] [INFO ] Flatten gal took : 38 ms
[2024-05-21 19:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 8 ms.
[2024-05-21 19:42:11] [INFO ] Time to serialize gal into /tmp/LTL9387906987017180924.gal : 3 ms
[2024-05-21 19:42:11] [INFO ] Time to serialize properties into /tmp/LTL11425247835551965830.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/LTL9387906987017180924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11425247835551965830.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.u0.s1<1)||(i7.u16.l1216<1))"))))
Formula 0 simplified : FG!"((i0.i0.u0.s1<1)||(i7.u16.l1216<1))"
Reverse transition relation is NOT exact ! Due to transitions t2, t11, t57, t67, t98, t170, t200, t202, t206, t207, t208, t209, t214, t215, t216, t217, t21...420
Computing Next relation with stutter on 2.74477e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
1067 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6907,209032,1,0,168655,32097,1584,1.5049e+06,469,252447,342610
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-03 finished in 92982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((p1 U p2)&&F(p3)))||p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 190
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 123 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 112 transition count 173
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 112 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 112 transition count 169
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 103 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 103 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 103 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 98 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 98 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 98 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 95 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 95 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 95 transition count 133
Applied a total of 117 rules in 12 ms. Remains 95 /144 variables (removed 49) and now considering 133/256 (removed 123) transitions.
// Phase 1: matrix 133 rows 95 cols
[2024-05-21 19:42:23] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:42:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:42:23] [INFO ] Invariant cache hit.
[2024-05-21 19:42:23] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 19:42:23] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-21 19:42:23] [INFO ] Invariant cache hit.
[2024-05-21 19:42:23] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/228 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 53/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 150 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/228 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 53/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 132/282 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 282 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8197ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8198ms
Starting structural reductions in LTL mode, iteration 1 : 95/144 places, 133/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8427 ms. Remains : 95/144 places, 133/256 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-04 finished in 8709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 121 transition count 176
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 109 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 109 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 109 transition count 157
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 98 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 98 transition count 140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 98 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 91 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 91 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 91 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 87 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 87 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 86 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 86 transition count 110
Applied a total of 137 rules in 15 ms. Remains 86 /144 variables (removed 58) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 86 cols
[2024-05-21 19:42:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:42:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:42:32] [INFO ] Invariant cache hit.
[2024-05-21 19:42:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 19:42:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 19:42:32] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:42:32] [INFO ] Invariant cache hit.
[2024-05-21 19:42:32] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 126 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 109/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 235 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6208ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6210ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6417 ms. Remains : 86/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-05 finished in 6512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1||X(F(p2))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 123 transition count 190
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 111 transition count 175
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 111 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 111 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 102 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 102 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 102 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 96 transition count 134
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 96 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 96 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 93 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 92 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 92 transition count 125
Applied a total of 125 rules in 11 ms. Remains 92 /144 variables (removed 52) and now considering 125/256 (removed 131) transitions.
// Phase 1: matrix 125 rows 92 cols
[2024-05-21 19:42:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:42:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:42:38] [INFO ] Invariant cache hit.
[2024-05-21 19:42:38] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 19:42:38] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-21 19:42:38] [INFO ] Invariant cache hit.
[2024-05-21 19:42:38] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/217 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 141 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/217 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 124/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 265 constraints, problems are : Problem set: 0 solved, 124 unsolved in 4871 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 7421ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7422ms
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 125/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7621 ms. Remains : 92/144 places, 125/256 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 318 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-06 finished in 8140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U !p1)||F((F(G(p1))&&p2)))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 122 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 109 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 109 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 109 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 98 transition count 143
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 98 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 98 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 91 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 91 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 91 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 113
Applied a total of 136 rules in 5 ms. Remains 86 /144 variables (removed 58) and now considering 113/256 (removed 143) transitions.
// Phase 1: matrix 113 rows 86 cols
[2024-05-21 19:42:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:42:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:42:46] [INFO ] Invariant cache hit.
[2024-05-21 19:42:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 19:42:47] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 19:42:47] [INFO ] Invariant cache hit.
[2024-05-21 19:42:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/199 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 41/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 129 constraints, problems are : Problem set: 0 solved, 112 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/199 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 41/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4363 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 6437ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6438ms
Starting structural reductions in LTL mode, iteration 1 : 86/144 places, 113/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6627 ms. Remains : 86/144 places, 113/256 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p2) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-07 finished in 6931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((p1||G(!p2)||X(p3))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 123 transition count 190
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 112 transition count 179
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 112 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 112 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 103 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 103 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 99 place count 103 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 97 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 97 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 97 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 116 place count 93 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 93 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 93 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 92 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 92 transition count 127
Applied a total of 125 rules in 20 ms. Remains 92 /144 variables (removed 52) and now considering 127/256 (removed 129) transitions.
// Phase 1: matrix 127 rows 92 cols
[2024-05-21 19:42:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:42:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 19:42:53] [INFO ] Invariant cache hit.
[2024-05-21 19:42:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 19:42:53] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 19:42:53] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-21 19:42:54] [INFO ] Invariant cache hit.
[2024-05-21 19:42:54] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/219 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:42:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/219 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 126/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 271 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 10079ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/144 places, 127/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10313 ms. Remains : 92/144 places, 127/256 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-08
Product exploration explored 100000 steps with 22892 reset in 125 ms.
Product exploration explored 100000 steps with 23061 reset in 124 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 319 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (9180 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1850 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1852 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3940 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1792 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 26119 steps, run visited all 7 properties in 302 ms. (steps per millisecond=86 )
Probabilistic random walk after 26119 steps, saw 11985 distinct states, run finished after 302 ms. (steps per millisecond=86 ) properties seen :7
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0), (F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F p2)]
Knowledge based reduction with 11 factoid took 302 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 127/127 transitions.
Applied a total of 0 rules in 10 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 19:43:05] [INFO ] Invariant cache hit.
[2024-05-21 19:43:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 19:43:05] [INFO ] Invariant cache hit.
[2024-05-21 19:43:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 19:43:06] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 19:43:06] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-21 19:43:06] [INFO ] Invariant cache hit.
[2024-05-21 19:43:06] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/219 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:43:08] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:43:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/219 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 126/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 271 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 10004ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10005ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10214 ms. Remains : 92/92 places, 127/127 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 319 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (9147 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1821 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1935 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1944 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3964 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1885 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 26119 steps, run visited all 7 properties in 236 ms. (steps per millisecond=110 )
Probabilistic random walk after 26119 steps, saw 11985 distinct states, run finished after 237 ms. (steps per millisecond=110 ) properties seen :7
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0), (F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F p2)]
Knowledge based reduction with 11 factoid took 384 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Product exploration explored 100000 steps with 23004 reset in 121 ms.
Product exploration explored 100000 steps with 22843 reset in 128 ms.
Built C files in :
/tmp/ltsmin10498064392495474404
[2024-05-21 19:43:18] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-21 19:43:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:43:18] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-21 19:43:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:43:18] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-21 19:43:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:43:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10498064392495474404
Running compilation step : cd /tmp/ltsmin10498064392495474404;'/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 310 ms.
Running link step : cd /tmp/ltsmin10498064392495474404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10498064392495474404;'/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/stateBased8703237580975041830.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 19:43:33] [INFO ] Invariant cache hit.
[2024-05-21 19:43:33] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 19:43:33] [INFO ] Invariant cache hit.
[2024-05-21 19:43:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 19:43:33] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-21 19:43:33] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-21 19:43:33] [INFO ] Invariant cache hit.
[2024-05-21 19:43:33] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/219 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:43:35] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:43:35] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-21 19:43:35] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:43:36] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 19:43:36] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/219 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 126/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 271 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
After SMT, in 10269ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10270ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10494 ms. Remains : 92/92 places, 127/127 transitions.
Built C files in :
/tmp/ltsmin1335144347263632705
[2024-05-21 19:43:43] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-21 19:43:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:43:43] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-21 19:43:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:43:43] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-21 19:43:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:43:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1335144347263632705
Running compilation step : cd /tmp/ltsmin1335144347263632705;'/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 318 ms.
Running link step : cd /tmp/ltsmin1335144347263632705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1335144347263632705;'/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/stateBased14786581278129115117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:43:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:43:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:43:59] [INFO ] Time to serialize gal into /tmp/LTL1492420046762344505.gal : 2 ms
[2024-05-21 19:43:59] [INFO ] Time to serialize properties into /tmp/LTL3263733325547346753.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/LTL1492420046762344505.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17491371573261843229.hoa' '-atoms' '/tmp/LTL3263733325547346753.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/LTL3263733325547346753.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17491371573261843229.hoa
Detected timeout of ITS tools.
[2024-05-21 19:44:14] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:44:14] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:44:14] [INFO ] Time to serialize gal into /tmp/LTL4501247230421633666.gal : 2 ms
[2024-05-21 19:44:14] [INFO ] Time to serialize properties into /tmp/LTL14555379467808265977.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/LTL4501247230421633666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14555379467808265977.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((G("((p124>=1)&&(l532>=1))"))||(F((("(((p124<1)||(l532<1))&&((s1<1)||(l612<1)))")||(G("((s1<1)||(l1018<1))")))||(X("((s1<1)||(l61...168
Formula 0 simplified : F(F!"((p124>=1)&&(l532>=1))" & G(!"(((p124<1)||(l532<1))&&((s1<1)||(l612<1)))" & F!"((s1<1)||(l1018<1))" & X!"((s1<1)||(l612<1))"))
Detected timeout of ITS tools.
[2024-05-21 19:44:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:44:29] [INFO ] Applying decomposition
[2024-05-21 19:44:29] [INFO ] Flatten gal took : 7 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/graph8941834935430220278.txt' '-o' '/tmp/graph8941834935430220278.bin' '-w' '/tmp/graph8941834935430220278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8941834935430220278.bin' '-l' '-1' '-v' '-w' '/tmp/graph8941834935430220278.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:44:29] [INFO ] Decomposing Gal with order
[2024-05-21 19:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:44:29] [INFO ] Removed a total of 154 redundant transitions.
[2024-05-21 19:44:29] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 7 ms.
[2024-05-21 19:44:29] [INFO ] Time to serialize gal into /tmp/LTL4112814731134295948.gal : 7 ms
[2024-05-21 19:44:29] [INFO ] Time to serialize properties into /tmp/LTL10831848728341524836.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/LTL4112814731134295948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10831848728341524836.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...255
Read 1 LTL properties
Checking formula 0 : !((G((G("((i6.u17.p124>=1)&&(i3.u0.l532>=1))"))||(F((("(((i6.u17.p124<1)||(i3.u0.l532<1))&&((i3.u0.s1<1)||(i3.u11.l612<1)))")||(G("((i...233
Formula 0 simplified : F(F!"((i6.u17.p124>=1)&&(i3.u0.l532>=1))" & G(!"(((i6.u17.p124<1)||(i3.u0.l532<1))&&((i3.u0.s1<1)||(i3.u11.l612<1)))" & F!"((i3.u0.s...219
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-08 finished in 110447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 109 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 109 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 109 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 99 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 99 transition count 144
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 99 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 92 transition count 121
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 92 transition count 121
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 127 place count 92 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 89 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 89 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 88 transition count 109
Applied a total of 137 rules in 14 ms. Remains 88 /144 variables (removed 56) and now considering 109/256 (removed 147) transitions.
// Phase 1: matrix 109 rows 88 cols
[2024-05-21 19:44:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:44:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 19:44:44] [INFO ] Invariant cache hit.
[2024-05-21 19:44:44] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:44:44] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 19:44:44] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 19:44:44] [INFO ] Invariant cache hit.
[2024-05-21 19:44:44] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3814 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 5766ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 109/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5986 ms. Remains : 88/144 places, 109/256 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-09 finished in 6035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U !p1)&&(p2||X((p3||G(p4)))))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 125 transition count 195
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 115 transition count 182
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 115 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 115 transition count 178
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 107 transition count 167
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 107 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 107 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 102 transition count 153
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 102 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 102 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 99 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 99 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 99 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 98 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 98 transition count 144
Applied a total of 112 rules in 12 ms. Remains 98 /144 variables (removed 46) and now considering 144/256 (removed 112) transitions.
// Phase 1: matrix 144 rows 98 cols
[2024-05-21 19:44:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:44:50] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 19:44:50] [INFO ] Invariant cache hit.
[2024-05-21 19:44:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 19:44:50] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-21 19:44:50] [INFO ] Invariant cache hit.
[2024-05-21 19:44:50] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/242 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 59/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 159 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/242 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 59/159 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 143/302 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 302 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 9217ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 9219ms
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 144/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9463 ms. Remains : 98/144 places, 144/256 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR p1 (AND (NOT p2) (NOT p3) (NOT p4))), (OR p1 (AND (NOT p2) (NOT p3) (NOT p4))), p0, p1, (AND (NOT p4) (NOT p3)), true, (NOT p4)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-10 finished in 9868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(G(p2))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 122 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 110 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 110 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 110 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 100 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 100 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 100 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 94 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 94 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 91 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 118
Applied a total of 127 rules in 10 ms. Remains 90 /144 variables (removed 54) and now considering 118/256 (removed 138) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-21 19:45:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:45:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 19:45:00] [INFO ] Invariant cache hit.
[2024-05-21 19:45:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 19:45:00] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 19:45:00] [INFO ] Invariant cache hit.
[2024-05-21 19:45:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 250 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6398ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6400ms
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 118/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6594 ms. Remains : 90/144 places, 118/256 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-12
Product exploration explored 100000 steps with 22858 reset in 126 ms.
Product exploration explored 100000 steps with 22856 reset in 142 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND p0 p2) (AND p1 p2))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (9153 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1845 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1876 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1886 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1863 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 25271 steps, run visited all 5 properties in 137 ms. (steps per millisecond=184 )
Probabilistic random walk after 25271 steps, saw 11782 distinct states, run finished after 137 ms. (steps per millisecond=184 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND p0 p2) (AND p1 p2))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR p0 p1) p2))), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 15 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-12 finished in 7732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 122 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 110 transition count 163
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 110 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 110 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 100 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 100 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 100 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 94 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 94 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 94 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 91 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 91 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 117
Applied a total of 127 rules in 12 ms. Remains 90 /144 variables (removed 54) and now considering 117/256 (removed 139) transitions.
// Phase 1: matrix 117 rows 90 cols
[2024-05-21 19:45:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:45:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:45:07] [INFO ] Invariant cache hit.
[2024-05-21 19:45:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:45:08] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 19:45:08] [INFO ] Invariant cache hit.
[2024-05-21 19:45:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 19:45:09] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:45:09] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:45:09] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7361ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7363ms
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 117/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7564 ms. Remains : 90/144 places, 117/256 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-14
Product exploration explored 100000 steps with 23073 reset in 100 ms.
Product exploration explored 100000 steps with 22859 reset in 106 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9172 resets) in 84 ms. (470 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-05-21 19:45:15] [INFO ] Invariant cache hit.
[2024-05-21 19:45:15] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 13 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9154 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 14 ms. (steps per millisecond=618 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 14 ms. (steps per millisecond=618 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 19:45:16] [INFO ] Invariant cache hit.
[2024-05-21 19:45:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 19:45:16] [INFO ] Invariant cache hit.
[2024-05-21 19:45:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:45:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 19:45:16] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 19:45:16] [INFO ] Invariant cache hit.
[2024-05-21 19:45:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 19:45:18] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:45:18] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:45:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/207 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 7471ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7671 ms. Remains : 90/90 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9141 resets) in 140 ms. (283 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-05-21 19:45:24] [INFO ] Invariant cache hit.
[2024-05-21 19:45:24] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 5 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9173 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1933 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 14 ms. (steps per millisecond=618 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 14 ms. (steps per millisecond=618 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22889 reset in 104 ms.
Product exploration explored 100000 steps with 23009 reset in 114 ms.
Built C files in :
/tmp/ltsmin295405897989097065
[2024-05-21 19:45:25] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-21 19:45:25] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:45:25] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-21 19:45:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:45:25] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-21 19:45:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:45:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin295405897989097065
Running compilation step : cd /tmp/ltsmin295405897989097065;'/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 298 ms.
Running link step : cd /tmp/ltsmin295405897989097065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin295405897989097065;'/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/stateBased9657331137632494428.hoa' '--buchi-type=spotba'
LTSmin run took 286 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-14 finished in 18195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 120 transition count 175
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 107 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 107 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 83 place count 107 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 93 place count 97 transition count 139
Iterating global reduction 2 with 10 rules applied. Total rules applied 103 place count 97 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 97 transition count 133
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 116 place count 90 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 90 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 90 transition count 114
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 86 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 86 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 106
Applied a total of 139 rules in 4 ms. Remains 85 /144 variables (removed 59) and now considering 106/256 (removed 150) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 19:45:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:45:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:45:26] [INFO ] Invariant cache hit.
[2024-05-21 19:45:26] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:45:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 19:45:26] [INFO ] Invariant cache hit.
[2024-05-21 19:45:26] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 105/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 226 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 5487ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5488ms
Starting structural reductions in LTL mode, iteration 1 : 85/144 places, 106/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5670 ms. Remains : 85/144 places, 106/256 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-15 finished in 6024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((p1||G(!p2)||X(p3))))))'
[2024-05-21 19:45:32] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16076801756281704826
[2024-05-21 19:45:32] [INFO ] Applying decomposition
[2024-05-21 19:45:32] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 19:45:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:45:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:45:32] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 19:45:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:45:32] [INFO ] Computing Do-Not-Accords matrix : 256 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/graph11627736790028162584.txt' '-o' '/tmp/graph11627736790028162584.bin' '-w' '/tmp/graph11627736790028162584.weights'
[2024-05-21 19:45:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11627736790028162584.bin' '-l' '-1' '-v' '-w' '/tmp/graph11627736790028162584.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:45:32] [INFO ] Decomposing Gal with order
[2024-05-21 19:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:45:32] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16076801756281704826
Running compilation step : cd /tmp/ltsmin16076801756281704826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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 19:45:32] [INFO ] Removed a total of 272 redundant transitions.
[2024-05-21 19:45:32] [INFO ] Flatten gal took : 26 ms
[2024-05-21 19:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 5 ms.
[2024-05-21 19:45:32] [INFO ] Time to serialize gal into /tmp/LTLFireability9073670269033320079.gal : 3 ms
[2024-05-21 19:45:32] [INFO ] Time to serialize properties into /tmp/LTLFireability7892579817272420817.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/LTLFireability9073670269033320079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7892579817272420817.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...276
Read 1 LTL properties
Checking formula 0 : !((G((G("((i3.u0.p124>=1)&&(i3.u0.l532>=1))"))||(F((("(((i3.u0.p124<1)||(i3.u0.l532<1))&&((i3.u0.s1<1)||(u3.l612<1)))")||(G(!("((i3.u0...228
Formula 0 simplified : F(F!"((i3.u0.p124>=1)&&(i3.u0.l532>=1))" & G(!"(((i3.u0.p124<1)||(i3.u0.l532<1))&&((i3.u0.s1<1)||(u3.l612<1)))" & F"((i3.u0.s1>=1)&&...210
Compilation finished in 690 ms.
Running link step : cd /tmp/ltsmin16076801756281704826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16076801756281704826;'/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' '[](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||[](!(LTLAPp2==true))||X((LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 626774 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1044701 ms.

BK_STOP 1716321360016

--------------------
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-d1m07"
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-d1m07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189400516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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