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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 119K 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-d0m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716317213086

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 18:46:54] [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 18:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:46:54] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 18:46:54] [INFO ] Transformed 553 places.
[2024-05-21 18:46:54] [INFO ] Transformed 150 transitions.
[2024-05-21 18:46:54] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 115
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 81 transition count 109
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 81 transition count 109
Applied a total of 60 rules in 30 ms. Remains 81 /109 variables (removed 28) and now considering 109/150 (removed 41) transitions.
// Phase 1: matrix 109 rows 81 cols
[2024-05-21 18:46:54] [INFO ] Computed 2 invariants in 13 ms
[2024-05-21 18:46:54] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 18:46:54] [INFO ] Invariant cache hit.
[2024-05-21 18:46:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 18:46:54] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-21 18:46:54] [INFO ] Invariant cache hit.
[2024-05-21 18:46:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 42/42 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/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 108/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 233 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3616 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6123ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6139ms
Starting structural reductions in LTL mode, iteration 1 : 81/109 places, 109/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6540 ms. Remains : 81/109 places, 109/150 transitions.
Support contains 31 out of 81 places after structural reductions.
[2024-05-21 18:47:01] [INFO ] Flatten gal took : 36 ms
[2024-05-21 18:47:01] [INFO ] Flatten gal took : 15 ms
[2024-05-21 18:47:01] [INFO ] Input system was already deterministic with 109 transitions.
Reduction of identical properties reduced properties to check from 29 to 26
RANDOM walk for 40000 steps (9183 resets) in 2490 ms. (16 steps per ms) remains 10/26 properties
BEST_FIRST walk for 40001 steps (1997 resets) in 383 ms. (104 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (2009 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4181 resets) in 343 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1975 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2001 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (4134 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2020 resets) in 108 ms. (366 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (4096 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
[2024-05-21 18:47:02] [INFO ] Invariant cache hit.
[2024-05-21 18:47:02] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 22/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 90/153 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 37/190 variables, 18/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 9 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 22/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 90/153 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 37/190 variables, 18/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 134 constraints, problems are : Problem set: 0 solved, 9 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 3 properties in 1118 ms.
Support contains 10 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 70 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 68 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 67 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 67 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 67 transition count 83
Applied a total of 30 rules in 25 ms. Remains 67 /81 variables (removed 14) and now considering 83/109 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 67/81 places, 83/109 transitions.
RANDOM walk for 40000 steps (9133 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2020 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2043 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4152 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1987 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2055 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4078 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 4541 steps, run visited all 6 properties in 20 ms. (steps per millisecond=227 )
Probabilistic random walk after 4541 steps, saw 2060 distinct states, run finished after 26 ms. (steps per millisecond=174 ) properties seen :6
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 271 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 65 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 77
Applied a total of 36 rules in 7 ms. Remains 65 /81 variables (removed 16) and now considering 77/109 (removed 32) transitions.
// Phase 1: matrix 77 rows 65 cols
[2024-05-21 18:47:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 18:47:05] [INFO ] Invariant cache hit.
[2024-05-21 18:47:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 18:47:05] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-21 18:47:05] [INFO ] Invariant cache hit.
[2024-05-21 18:47:05] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/142 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/142 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3348ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3349ms
Starting structural reductions in LTL mode, iteration 1 : 65/81 places, 77/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3538 ms. Remains : 65/81 places, 77/109 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-00 finished in 3773 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)&&F(G(p1)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 70 transition count 87
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 64 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 63 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Applied a total of 46 rules in 21 ms. Remains 61 /81 variables (removed 20) and now considering 71/109 (removed 38) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 18:47:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:47:09] [INFO ] Invariant cache hit.
[2024-05-21 18:47:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 18:47:09] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-21 18:47:09] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 18:47:09] [INFO ] Invariant cache hit.
[2024-05-21 18:47:09] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-21 18:47:10] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 7 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 85 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 71/132 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 70/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 1/1 constraints]
After SMT, in 3604ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3606ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/81 places, 71/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3770 ms. Remains : 61/81 places, 71/109 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-01
Product exploration explored 100000 steps with 22913 reset in 223 ms.
Product exploration explored 100000 steps with 23009 reset in 158 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 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 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 28247 steps (6499 resets) in 179 ms. (156 steps per ms) remains 0/2 properties
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 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 18:47:14] [INFO ] Invariant cache hit.
[2024-05-21 18:47:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 18:47:14] [INFO ] Invariant cache hit.
[2024-05-21 18:47:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 18:47:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-21 18:47:14] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 18:47:14] [INFO ] Invariant cache hit.
[2024-05-21 18:47:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-21 18:47:15] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 85 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1744 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 71/132 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 70/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 1/1 constraints]
After SMT, in 3566ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3567ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3716 ms. Remains : 61/61 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 9 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 69 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 15494 steps (3547 resets) in 45 ms. (336 steps per ms) remains 0/2 properties
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 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22968 reset in 97 ms.
Product exploration explored 100000 steps with 23006 reset in 191 ms.
Built C files in :
/tmp/ltsmin9309661981237500747
[2024-05-21 18:47:19] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 18:47:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:47:19] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 18:47:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:47:19] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 18:47:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:47:19] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9309661981237500747
Running compilation step : cd /tmp/ltsmin9309661981237500747;'/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 313 ms.
Running link step : cd /tmp/ltsmin9309661981237500747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9309661981237500747;'/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/stateBased17466892039794758561.hoa' '--buchi-type=spotba'
LTSmin run took 107 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-01 finished in 10278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 65 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 65 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 63 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 63 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 60 transition count 70
Applied a total of 48 rules in 22 ms. Remains 60 /81 variables (removed 21) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 18:47:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 18:47:19] [INFO ] Invariant cache hit.
[2024-05-21 18:47:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:47:19] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-21 18:47:19] [INFO ] Redundant transitions in 0 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 18:47:19] [INFO ] Invariant cache hit.
[2024-05-21 18:47:19] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 85 constraints, problems are : Problem set: 0 solved, 69 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 154 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2565ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/81 places, 70/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2716 ms. Remains : 60/81 places, 70/109 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-02 finished in 3063 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(X(p0)) U G((X(G(p1)) U p2)))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 91
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 66 transition count 83
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 64 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 63 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
Applied a total of 40 rules in 6 ms. Remains 63 /81 variables (removed 18) and now considering 75/109 (removed 34) transitions.
// Phase 1: matrix 75 rows 63 cols
[2024-05-21 18:47:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 18:47:22] [INFO ] Invariant cache hit.
[2024-05-21 18:47:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:47:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 18:47:22] [INFO ] Invariant cache hit.
[2024-05-21 18:47:22] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 90 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 74/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 164 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3121ms
Starting structural reductions in LTL mode, iteration 1 : 63/81 places, 75/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3244 ms. Remains : 63/81 places, 75/109 transitions.
Stuttering acceptance computed with spot in 588 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-03 finished in 3852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)||p0))||(F(p3)&&p2))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 67 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 67 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 67 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 62 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 62 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 62 transition count 70
Applied a total of 46 rules in 9 ms. Remains 62 /81 variables (removed 19) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 62 cols
[2024-05-21 18:47:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:47:26] [INFO ] Invariant cache hit.
[2024-05-21 18:47:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:47:26] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 18:47:26] [INFO ] Invariant cache hit.
[2024-05-21 18:47:26] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/132 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-21 18:47:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 90 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 70/132 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 69/159 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 159 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
After SMT, in 3430ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3431ms
Starting structural reductions in LTL mode, iteration 1 : 62/81 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3569 ms. Remains : 62/81 places, 70/109 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (AND (NOT p3) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-06
Product exploration explored 100000 steps with 22802 reset in 86 ms.
Product exploration explored 100000 steps with 22783 reset in 94 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (AND p0 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 100 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (9224 resets) in 119 ms. (333 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (2074 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2091 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2024-05-21 18:47:30] [INFO ] Invariant cache hit.
[2024-05-21 18:47:30] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/130 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/132 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/130 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/132 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/132 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/132 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 14 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (AND p0 (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 173 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 18:47:31] [INFO ] Invariant cache hit.
[2024-05-21 18:47:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:47:31] [INFO ] Invariant cache hit.
[2024-05-21 18:47:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:47:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 18:47:31] [INFO ] Invariant cache hit.
[2024-05-21 18:47:31] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/132 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-21 18:47:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 90 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 70/132 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 69/159 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 159 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
After SMT, in 3436ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3437ms
Finished structural reductions in LTL mode , in 1 iterations and 3562 ms. Remains : 62/62 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (9125 resets) in 110 ms. (360 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (2123 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1966 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-05-21 18:47:35] [INFO ] Invariant cache hit.
[2024-05-21 18:47:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/130 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/132 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/130 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/132 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/132 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/132 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 24 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23030 reset in 84 ms.
Product exploration explored 100000 steps with 22990 reset in 138 ms.
Built C files in :
/tmp/ltsmin7467665949319131293
[2024-05-21 18:47:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7467665949319131293
Running compilation step : cd /tmp/ltsmin7467665949319131293;'/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 167 ms.
Running link step : cd /tmp/ltsmin7467665949319131293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7467665949319131293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7029027473487441445.hoa' '--buchi-type=spotba'
LTSmin run took 2914 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-06 finished in 13500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((X(p2)&&p1)))||p0)))'
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 66 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 79
Applied a total of 34 rules in 2 ms. Remains 66 /81 variables (removed 15) and now considering 79/109 (removed 30) transitions.
// Phase 1: matrix 79 rows 66 cols
[2024-05-21 18:47:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 18:47:40] [INFO ] Invariant cache hit.
[2024-05-21 18:47:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:47:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-21 18:47:40] [INFO ] Invariant cache hit.
[2024-05-21 18:47:40] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 90 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 78/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3352ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3352ms
Starting structural reductions in LTL mode, iteration 1 : 66/81 places, 79/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3486 ms. Remains : 66/81 places, 79/109 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 215 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-07 finished in 3882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(G(p1))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 72 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 65 transition count 83
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 65 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 65 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 63 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 61 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 60 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 49 place count 60 transition count 71
Applied a total of 49 rules in 7 ms. Remains 60 /81 variables (removed 21) and now considering 71/109 (removed 38) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 18:47:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 18:47:43] [INFO ] Invariant cache hit.
[2024-05-21 18:47:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:47:43] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-21 18:47:43] [INFO ] Invariant cache hit.
[2024-05-21 18:47:43] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2715ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2715ms
Starting structural reductions in LTL mode, iteration 1 : 60/81 places, 71/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2856 ms. Remains : 60/81 places, 71/109 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-08
Stuttering criterion allowed to conclude after 9594 steps with 2221 reset in 8 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-08 finished in 3071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U p1)||X(p2)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 65 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 63 transition count 73
Applied a total of 41 rules in 6 ms. Remains 63 /81 variables (removed 18) and now considering 73/109 (removed 36) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 18:47:46] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:47:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 18:47:46] [INFO ] Invariant cache hit.
[2024-05-21 18:47:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:47:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 18:47:47] [INFO ] Invariant cache hit.
[2024-05-21 18:47:47] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 72 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 160 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2904ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2906ms
Starting structural reductions in LTL mode, iteration 1 : 63/81 places, 73/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3052 ms. Remains : 63/81 places, 73/109 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-09 finished in 3464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U !p1))&&(X(p3)||p2))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 70 transition count 87
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 63 transition count 77
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 61 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 58 transition count 64
Applied a total of 54 rules in 7 ms. Remains 58 /81 variables (removed 23) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 18:47:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 18:47:50] [INFO ] Invariant cache hit.
[2024-05-21 18:47:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:47:50] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 18:47:50] [INFO ] Invariant cache hit.
[2024-05-21 18:47:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2249ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2249ms
Starting structural reductions in LTL mode, iteration 1 : 58/81 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2385 ms. Remains : 58/81 places, 64/109 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p3) p1), p1, (OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2)), (X p2), (X (X (NOT p3))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (AND p1 (NOT p0)) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-10 finished in 2760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(!p1)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 88
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 64 transition count 78
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 62 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 51 place count 59 transition count 66
Applied a total of 51 rules in 10 ms. Remains 59 /81 variables (removed 22) and now considering 66/109 (removed 43) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 18:47:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:47:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 18:47:53] [INFO ] Invariant cache hit.
[2024-05-21 18:47:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:47:53] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 18:47:53] [INFO ] Invariant cache hit.
[2024-05-21 18:47:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2525ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2526ms
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 66/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2648 ms. Remains : 59/81 places, 66/109 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-11
Product exploration explored 100000 steps with 22987 reset in 73 ms.
Product exploration explored 100000 steps with 23044 reset in 83 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 190 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (9224 resets) in 54 ms. (727 steps per ms) remains 1/2 properties
BEST_FIRST walk for 33017 steps (1683 resets) in 17 ms. (1834 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-21 18:47:56] [INFO ] Invariant cache hit.
[2024-05-21 18:47:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 18:47:56] [INFO ] Invariant cache hit.
[2024-05-21 18:47:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:47:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 18:47:56] [INFO ] Invariant cache hit.
[2024-05-21 18:47:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2448ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2449ms
Finished structural reductions in LTL mode , in 1 iterations and 2555 ms. Remains : 59/59 places, 66/66 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 190 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (9116 resets) in 58 ms. (677 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (2021 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-21 18:47:59] [INFO ] Invariant cache hit.
[2024-05-21 18:47:59] [INFO ] State equation strengthened by 20 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) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/94 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/125 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 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) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/94 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/125 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 66/66 transitions.
Graph (complete) has 174 edges and 59 vertex of which 58 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 57 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 57 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 57 transition count 63
Applied a total of 5 rules in 8 ms. Remains 57 /59 variables (removed 2) and now considering 63/66 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 57/59 places, 63/66 transitions.
RANDOM walk for 40000 steps (9271 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1971 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3869 steps, run visited all 1 properties in 18 ms. (steps per millisecond=214 )
Probabilistic random walk after 3869 steps, saw 1733 distinct states, run finished after 18 ms. (steps per millisecond=214 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 22978 reset in 77 ms.
Product exploration explored 100000 steps with 22888 reset in 82 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-21 18:48:00] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 18:48:00] [INFO ] Invariant cache hit.
[2024-05-21 18:48:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2507ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2508ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2520 ms. Remains : 59/59 places, 66/66 transitions.
Built C files in :
/tmp/ltsmin4683677297483868809
[2024-05-21 18:48:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4683677297483868809
Running compilation step : cd /tmp/ltsmin4683677297483868809;'/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 158 ms.
Running link step : cd /tmp/ltsmin4683677297483868809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4683677297483868809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1295076184658611576.hoa' '--buchi-type=spotba'
LTSmin run took 106 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-11 finished in 10355 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)&&F(G(p1)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 70 transition count 87
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 64 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 63 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Applied a total of 40 rules in 5 ms. Remains 63 /81 variables (removed 18) and now considering 75/109 (removed 34) transitions.
// Phase 1: matrix 75 rows 63 cols
[2024-05-21 18:48:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:48:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 18:48:03] [INFO ] Invariant cache hit.
[2024-05-21 18:48:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:48:03] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 18:48:03] [INFO ] Invariant cache hit.
[2024-05-21 18:48:03] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 87 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 74/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 161 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2960ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2961ms
Starting structural reductions in LTL mode, iteration 1 : 63/81 places, 75/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3085 ms. Remains : 63/81 places, 75/109 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-13
Product exploration explored 100000 steps with 22947 reset in 86 ms.
Product exploration explored 100000 steps with 23014 reset in 96 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-21 18:48:07] [INFO ] Invariant cache hit.
[2024-05-21 18:48:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:48:07] [INFO ] Invariant cache hit.
[2024-05-21 18:48:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:48:07] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 18:48:07] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-21 18:48:07] [INFO ] Invariant cache hit.
[2024-05-21 18:48:07] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 87 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 74/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 161 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2943ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3078 ms. Remains : 63/63 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22802 reset in 95 ms.
Product exploration explored 100000 steps with 23030 reset in 109 ms.
Built C files in :
/tmp/ltsmin2626193112719087259
[2024-05-21 18:48:10] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-21 18:48:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:48:10] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-21 18:48:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:48:10] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-21 18:48:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:48:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2626193112719087259
Running compilation step : cd /tmp/ltsmin2626193112719087259;'/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 197 ms.
Running link step : cd /tmp/ltsmin2626193112719087259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2626193112719087259;'/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/stateBased15023377639457709329.hoa' '--buchi-type=spotba'
LTSmin run took 265 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-13 finished in 7980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||G((F(p0) U (F(p2)&&p1)))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 64 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 64 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 62 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 62 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 52 place count 59 transition count 69
Applied a total of 52 rules in 5 ms. Remains 59 /81 variables (removed 22) and now considering 69/109 (removed 40) transitions.
// Phase 1: matrix 69 rows 59 cols
[2024-05-21 18:48:11] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:48:11] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:48:11] [INFO ] Invariant cache hit.
[2024-05-21 18:48:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:48:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-21 18:48:11] [INFO ] Invariant cache hit.
[2024-05-21 18:48:11] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2618ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2618ms
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 69/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2755 ms. Remains : 59/81 places, 69/109 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-14 finished in 2940 ms.
All properties solved by simple procedures.
Total runtime 80222 ms.

BK_STOP 1716317294458

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

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