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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-d0m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716318444130

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-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 19:07:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:07:25] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 19:07:25] [INFO ] Transformed 553 places.
[2024-05-21 19:07:25] [INFO ] Transformed 150 transitions.
[2024-05-21 19:07:25] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 89 transition count 124
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 89 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 122
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 82 transition count 115
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 82 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 81 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 81 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 81 transition count 112
Applied a total of 63 rules in 39 ms. Remains 81 /109 variables (removed 28) and now considering 112/150 (removed 38) transitions.
// Phase 1: matrix 112 rows 81 cols
[2024-05-21 19:07:25] [INFO ] Computed 2 invariants in 14 ms
[2024-05-21 19:07:26] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 19:07:26] [INFO ] Invariant cache hit.
[2024-05-21 19:07:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 19:07:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-21 19:07:26] [INFO ] Invariant cache hit.
[2024-05-21 19:07:26] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/193 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 49/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 132 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/193 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 49/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 111/243 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 243 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 6633ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6653ms
Starting structural reductions in LTL mode, iteration 1 : 81/109 places, 112/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7082 ms. Remains : 81/109 places, 112/150 transitions.
Support contains 30 out of 81 places after structural reductions.
[2024-05-21 19:07:33] [INFO ] Flatten gal took : 28 ms
[2024-05-21 19:07:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:07:33] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 27 out of 81 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 40000 steps (9192 resets) in 2003 ms. (19 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40003 steps (1971 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4051 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1921 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3950 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1973 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1970 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (2044 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1974 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1989 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
[2024-05-21 19:07:34] [INFO ] Invariant cache hit.
[2024-05-21 19:07:34] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/39 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 90/149 variables, 59/61 constraints. Problems are: Problem set: 2 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 27/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 40/189 variables, 20/108 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 20/128 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/193 variables, 2/130 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 2/132 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 132 constraints, problems are : Problem set: 2 solved, 8 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 21/58 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 85/143 variables, 58/60 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 22/82 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 46/189 variables, 21/103 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 25/128 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 8/136 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/193 variables, 2/138 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/140 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 140 constraints, problems are : Problem set: 2 solved, 8 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 787ms problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1786 ms.
Support contains 11 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 112/112 transitions.
Graph (complete) has 240 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 80 transition count 111
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 74 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 74 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 72 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 72 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 71 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 71 transition count 90
Applied a total of 22 rules in 34 ms. Remains 71 /81 variables (removed 10) and now considering 90/112 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 71/81 places, 90/112 transitions.
RANDOM walk for 40000 steps (9210 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1995 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4001 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3998 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2025 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2014 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2062 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2021 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2005 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 34140 steps, run visited all 8 properties in 76 ms. (steps per millisecond=449 )
Probabilistic random walk after 34140 steps, saw 14578 distinct states, run finished after 80 ms. (steps per millisecond=426 ) properties seen :8
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 269 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((G(p1)||X(p2)||p0)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 87
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 64 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 64 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 62 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 62 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 42 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 59 transition count 69
Applied a total of 50 rules in 11 ms. Remains 59 /81 variables (removed 22) and now considering 69/112 (removed 43) transitions.
// Phase 1: matrix 69 rows 59 cols
[2024-05-21 19:07:37] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:07:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:07:37] [INFO ] Invariant cache hit.
[2024-05-21 19:07:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:07:37] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-21 19:07:37] [INFO ] Invariant cache hit.
[2024-05-21 19:07:37] [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
All remaining problems are real, not stopping.
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 886 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 1531 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 2469ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2470ms
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 69/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2606 ms. Remains : 59/81 places, 69/112 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 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 10 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 3383 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(G(p1))&&p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 64 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 38 place count 64 transition count 75
Applied a total of 38 rules in 12 ms. Remains 64 /81 variables (removed 17) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 19:07:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:07:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:07:41] [INFO ] Invariant cache hit.
[2024-05-21 19:07:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:07:41] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 19:07:41] [INFO ] Invariant cache hit.
[2024-05-21 19:07:41] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2823ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2824ms
Starting structural reductions in LTL mode, iteration 1 : 64/81 places, 75/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2993 ms. Remains : 64/81 places, 75/112 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-02 finished in 3132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 82
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 60 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 60 transition count 68
Applied a total of 46 rules in 17 ms. Remains 60 /81 variables (removed 21) and now considering 68/112 (removed 44) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 19:07:44] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:07:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:07:44] [INFO ] Invariant cache hit.
[2024-05-21 19:07:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:07:44] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-21 19:07:44] [INFO ] Redundant transitions in 0 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-21 19:07:44] [INFO ] Invariant cache hit.
[2024-05-21 19:07:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 67 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 150 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1834 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 2781ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2782ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/81 places, 68/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2913 ms. Remains : 60/81 places, 68/112 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-03 finished in 3005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 82
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 62 transition count 71
Applied a total of 42 rules in 15 ms. Remains 62 /81 variables (removed 19) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 62 cols
[2024-05-21 19:07:47] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:07:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:07:47] [INFO ] Invariant cache hit.
[2024-05-21 19:07:47] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:07:47] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-21 19:07:47] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:07:47] [INFO ] Invariant cache hit.
[2024-05-21 19:07:47] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/133 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 85 constraints, problems are : Problem set: 0 solved, 70 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/133 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 70/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2609ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/81 places, 71/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2770 ms. Remains : 62/81 places, 71/112 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-05 finished in 2818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 83
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 64 transition count 77
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 61 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 60 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 59 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 59 transition count 66
Applied a total of 49 rules in 11 ms. Remains 59 /81 variables (removed 22) and now considering 66/112 (removed 46) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 19:07:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:07:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:07:50] [INFO ] Invariant cache hit.
[2024-05-21 19:07:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:07:50] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 19:07:50] [INFO ] Invariant cache hit.
[2024-05-21 19:07:50] [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 808 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 1634 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 2478ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2479ms
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 66/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2605 ms. Remains : 59/81 places, 66/112 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-06 finished in 2694 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||G((p1 U p0)))))&&F(p2)))'
Support contains 3 out of 81 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 : 81/81 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 66 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 66 transition count 83
Applied a total of 30 rules in 10 ms. Remains 66 /81 variables (removed 15) and now considering 83/112 (removed 29) transitions.
// Phase 1: matrix 83 rows 66 cols
[2024-05-21 19:07:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:07:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 19:07:52] [INFO ] Invariant cache hit.
[2024-05-21 19:07:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:07:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-21 19:07:52] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-21 19:07:52] [INFO ] Invariant cache hit.
[2024-05-21 19:07:52] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 93 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 82/175 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 175 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 3658ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3659ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/81 places, 83/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3809 ms. Remains : 66/81 places, 83/112 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-07 finished in 3978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 67 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 67 transition count 86
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 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 65 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 36 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 76
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 62 transition count 74
Applied a total of 44 rules in 5 ms. Remains 62 /81 variables (removed 19) and now considering 74/112 (removed 38) transitions.
// Phase 1: matrix 74 rows 62 cols
[2024-05-21 19:07:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:07:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 19:07:56] [INFO ] Invariant cache hit.
[2024-05-21 19:07:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 19:07:56] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:07:56] [INFO ] Invariant cache hit.
[2024-05-21 19:07:56] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 29/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 93 constraints, problems are : Problem set: 0 solved, 73 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 29/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 73/166 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 166 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2870ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2871ms
Starting structural reductions in LTL mode, iteration 1 : 62/81 places, 74/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2998 ms. Remains : 62/81 places, 74/112 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-08 finished in 3198 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) U X(F(p1))) U p2)||G(!p0)))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Applied a total of 44 rules in 15 ms. Remains 61 /81 variables (removed 20) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 19:07:59] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:07:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:07:59] [INFO ] Invariant cache hit.
[2024-05-21 19:08:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:08:00] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 19:08:00] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:08:00] [INFO ] Invariant cache hit.
[2024-05-21 19:08:00] [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
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 70 unsolved in 999 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
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, 70/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1589 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: 0/0 constraints]
After SMT, in 2628ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/81 places, 71/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2778 ms. Remains : 61/81 places, 71/112 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) p0), (OR (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-09
Stuttering criterion allowed to conclude after 131 steps with 25 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-09 finished in 3013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 63 transition count 74
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 72
Applied a total of 40 rules in 13 ms. Remains 63 /81 variables (removed 18) and now considering 72/112 (removed 40) transitions.
// Phase 1: matrix 72 rows 63 cols
[2024-05-21 19:08:02] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:08:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:08:02] [INFO ] Invariant cache hit.
[2024-05-21 19:08:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:08:03] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 19:08:03] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 19:08:03] [INFO ] Invariant cache hit.
[2024-05-21 19:08: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, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1013 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: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2014 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: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 3065ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 3067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/81 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3212 ms. Remains : 63/81 places, 72/112 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-10 finished in 3262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Applied a total of 44 rules in 10 ms. Remains 61 /81 variables (removed 20) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 19:08:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:08:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:08:06] [INFO ] Invariant cache hit.
[2024-05-21 19:08:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:08:06] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-21 19:08:06] [INFO ] Invariant cache hit.
[2024-05-21 19:08:06] [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
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 70 unsolved in 999 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
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, 70/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1560 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: 0/0 constraints]
After SMT, in 2599ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2600ms
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 71/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2739 ms. Remains : 61/81 places, 71/112 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 87 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.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-11 finished in 3043 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) U G(p1)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 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
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 65 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 63 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 63 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 40 place count 63 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 60 transition count 74
Iterating global reduction 2 with 1 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 2 with 2 rules applied. Total rules applied 48 place count 60 transition count 72
Applied a total of 48 rules in 14 ms. Remains 60 /81 variables (removed 21) and now considering 72/112 (removed 40) transitions.
// Phase 1: matrix 72 rows 60 cols
[2024-05-21 19:08:09] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:08:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:08:09] [INFO ] Invariant cache hit.
[2024-05-21 19:08:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 19:08:09] [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.
[2024-05-21 19:08:09] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 19:08:09] [INFO ] Invariant cache hit.
[2024-05-21 19:08:09] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/132 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 28/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 90 constraints, problems are : Problem set: 0 solved, 71 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/132 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 28/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 71/161 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 161 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 3160ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 3160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/81 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3313 ms. Remains : 60/81 places, 72/112 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-12 finished in 3409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((G(p1) U p2))||X(G(p3)))))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 66 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 66 transition count 81
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 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 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 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 62 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 61 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 61 transition count 70
Applied a total of 45 rules in 8 ms. Remains 61 /81 variables (removed 20) and now considering 70/112 (removed 42) transitions.
// Phase 1: matrix 70 rows 61 cols
[2024-05-21 19:08:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:08:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:08:12] [INFO ] Invariant cache hit.
[2024-05-21 19:08:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 19:08:12] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 19:08:12] [INFO ] Invariant cache hit.
[2024-05-21 19:08:12] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 69 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 24/24 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 156 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2628ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2628ms
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 70/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2744 ms. Remains : 61/81 places, 70/112 transitions.
Stuttering acceptance computed with spot in 501 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-13 finished in 3276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(p1))) U X(X(X(!p0))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 63 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 63 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 60 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 60 transition count 70
Applied a total of 46 rules in 7 ms. Remains 60 /81 variables (removed 21) and now considering 70/112 (removed 42) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 19:08:15] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:08:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:08:15] [INFO ] Invariant cache hit.
[2024-05-21 19:08:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:08:16] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 19:08:16] [INFO ] Invariant cache hit.
[2024-05-21 19:08:16] [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
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 975 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 1804 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 2832ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2834ms
Starting structural reductions in LTL mode, iteration 1 : 60/81 places, 70/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2946 ms. Remains : 60/81 places, 70/112 transitions.
Stuttering acceptance computed with spot in 460 ms :[p0, p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, true, p0, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-15
Product exploration explored 100000 steps with 26662 reset in 108 ms.
Product exploration explored 100000 steps with 26695 reset in 121 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 (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 13 states, 19 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0, p0, true, p0]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 293 ms :[p0, p0, p0, p0, true, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 19:08:20] [INFO ] Invariant cache hit.
[2024-05-21 19:08:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:08:20] [INFO ] Invariant cache hit.
[2024-05-21 19:08:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:08:20] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 19:08:20] [INFO ] Invariant cache hit.
[2024-05-21 19:08:20] [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
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 1773 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 2769ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2770ms
Finished structural reductions in LTL mode , in 1 iterations and 2884 ms. Remains : 60/60 places, 70/70 transitions.
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.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p0, p0, p0, p0, true, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 26696 reset in 148 ms.
Product exploration explored 100000 steps with 26667 reset in 188 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 206 ms :[p0, p0, p0, p0, true, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 58 transition count 64
Applied a total of 6 rules in 13 ms. Remains 58 /60 variables (removed 2) and now considering 64/70 (removed 6) transitions.
[2024-05-21 19:08:24] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 19:08:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:08:24] [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
All remaining problems are real, not stopping.
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 798 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 1256 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 2088ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/60 places, 64/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2108 ms. Remains : 58/60 places, 64/70 transitions.
Built C files in :
/tmp/ltsmin1910338155283342515
[2024-05-21 19:08:27] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1910338155283342515
Running compilation step : cd /tmp/ltsmin1910338155283342515;'/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 306 ms.
Running link step : cd /tmp/ltsmin1910338155283342515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1910338155283342515;'/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/stateBased16537960523990969851.hoa' '--buchi-type=spotba'
LTSmin run took 458 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-15 finished in 12012 ms.
All properties solved by simple procedures.
Total runtime 62645 ms.

BK_STOP 1716318507967

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

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