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.r480-tall-171624189500564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717190636878

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:23:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:23:58] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-31 21:23:58] [INFO ] Transformed 4763 places.
[2024-05-31 21:23:58] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:23:58] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 369 places :
Symmetric choice reduction at 1 with 369 rule applications. Total rules 614 place count 768 transition count 1495
Iterating global reduction 1 with 369 rules applied. Total rules applied 983 place count 768 transition count 1495
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 1046 place count 768 transition count 1432
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1340 place count 474 transition count 1138
Iterating global reduction 2 with 294 rules applied. Total rules applied 1634 place count 474 transition count 1138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1640 place count 474 transition count 1132
Discarding 217 places :
Symmetric choice reduction at 3 with 217 rule applications. Total rules 1857 place count 257 transition count 827
Iterating global reduction 3 with 217 rules applied. Total rules applied 2074 place count 257 transition count 827
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 3 with 276 rules applied. Total rules applied 2350 place count 257 transition count 551
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2366 place count 241 transition count 528
Iterating global reduction 4 with 16 rules applied. Total rules applied 2382 place count 241 transition count 528
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2396 place count 241 transition count 514
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2406 place count 231 transition count 504
Iterating global reduction 5 with 10 rules applied. Total rules applied 2416 place count 231 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2418 place count 231 transition count 502
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2426 place count 223 transition count 494
Iterating global reduction 6 with 8 rules applied. Total rules applied 2434 place count 223 transition count 494
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2446 place count 223 transition count 482
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2448 place count 221 transition count 478
Iterating global reduction 7 with 2 rules applied. Total rules applied 2450 place count 221 transition count 478
Applied a total of 2450 rules in 204 ms. Remains 221 /1183 variables (removed 962) and now considering 478/2478 (removed 2000) transitions.
// Phase 1: matrix 478 rows 221 cols
[2024-05-31 21:23:59] [INFO ] Computed 2 invariants in 23 ms
[2024-05-31 21:23:59] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-31 21:23:59] [INFO ] Invariant cache hit.
[2024-05-31 21:23:59] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:24:00] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-31 21:24:00] [INFO ] Invariant cache hit.
[2024-05-31 21:24:00] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 478/699 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 268/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (OVERLAPS) 0/699 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 491 constraints, problems are : Problem set: 0 solved, 477 unsolved in 26642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 221/221 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 478/699 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 268/491 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 477/968 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 968 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 221/221 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 58194ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 58213ms
Starting structural reductions in LTL mode, iteration 1 : 221/1183 places, 478/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59629 ms. Remains : 221/1183 places, 478/2478 transitions.
Support contains 35 out of 221 places after structural reductions.
[2024-05-31 21:24:58] [INFO ] Flatten gal took : 57 ms
[2024-05-31 21:24:58] [INFO ] Flatten gal took : 30 ms
[2024-05-31 21:24:58] [INFO ] Input system was already deterministic with 478 transitions.
Support contains 33 out of 221 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 29
RANDOM walk for 40000 steps (9215 resets) in 2464 ms. (16 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (186 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (417 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (415 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (184 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (161 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (164 resets) in 72 ms. (54 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (172 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (187 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (176 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (165 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (188 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (173 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (160 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (187 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (172 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (170 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (186 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (400 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (181 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (187 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (413 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (163 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (168 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (168 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (182 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (179 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (186 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (173 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (173 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 562905 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :27 out of 29
Probabilistic random walk after 562905 steps, saw 227075 distinct states, run finished after 3005 ms. (steps per millisecond=187 ) properties seen :27
[2024-05-31 21:25:02] [INFO ] Invariant cache hit.
[2024-05-31 21:25:02] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/85 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/136 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/377 variables, 136/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 31/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 691/699 variables, and 250 constraints, problems are : Problem set: 2 solved, 0 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/221 constraints, ReadFeed: 31/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 36 stable transitions
Graph (complete) has 917 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 310
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 171 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 150 transition count 252
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 150 transition count 252
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 150 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 178 place count 138 transition count 205
Iterating global reduction 3 with 12 rules applied. Total rules applied 190 place count 138 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 138 transition count 200
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 201 place count 132 transition count 194
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 132 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 132 transition count 193
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 212 place count 128 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 128 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 128 transition count 186
Applied a total of 219 rules in 51 ms. Remains 128 /221 variables (removed 93) and now considering 186/478 (removed 292) transitions.
// Phase 1: matrix 186 rows 128 cols
[2024-05-31 21:25:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:25:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:25:03] [INFO ] Invariant cache hit.
[2024-05-31 21:25:03] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-31 21:25:03] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-31 21:25:03] [INFO ] Redundant transitions in 7 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 21:25:03] [INFO ] Invariant cache hit.
[2024-05-31 21:25:03] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/314 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 21:25:07] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 19 ms to minimize.
[2024-05-31 21:25:07] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 194 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/314 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 62/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 185/379 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 379 constraints, problems are : Problem set: 0 solved, 185 unsolved in 11923 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
After SMT, in 19227ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19229ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/221 places, 186/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19633 ms. Remains : 128/221 places, 186/478 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-00 finished in 19867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||X((p1 U p2))))||X(G(p1))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 349
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 344
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 173 transition count 317
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 173 transition count 317
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 113 place count 173 transition count 305
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 153 transition count 263
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 153 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 162 place count 153 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 141 transition count 222
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 141 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 141 transition count 216
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 198 place count 135 transition count 210
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 135 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 135 transition count 209
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 209 place count 131 transition count 205
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 131 transition count 202
Applied a total of 216 rules in 27 ms. Remains 131 /221 variables (removed 90) and now considering 202/478 (removed 276) transitions.
// Phase 1: matrix 202 rows 131 cols
[2024-05-31 21:25:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:25:23] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:25:23] [INFO ] Invariant cache hit.
[2024-05-31 21:25:23] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:25:23] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-31 21:25:23] [INFO ] Invariant cache hit.
[2024-05-31 21:25:23] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/333 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 79/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 212 constraints, problems are : Problem set: 0 solved, 201 unsolved in 6887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/333 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 79/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 201/413 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/333 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 413 constraints, problems are : Problem set: 0 solved, 201 unsolved in 12192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 19380ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 19384ms
Starting structural reductions in LTL mode, iteration 1 : 131/221 places, 202/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19759 ms. Remains : 131/221 places, 202/478 transitions.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01
Product exploration explored 100000 steps with 29857 reset in 308 ms.
Product exploration explored 100000 steps with 29817 reset in 248 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 484 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 158 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (9220 resets) in 399 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1782 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1815 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1769 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1788 resets) in 377 ms. (105 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1810 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1839 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1739 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1288172 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :8 out of 9
Probabilistic random walk after 1288172 steps, saw 540434 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :8
[2024-05-31 21:25:47] [INFO ] Invariant cache hit.
[2024-05-31 21:25:47] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/229 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 327/333 variables, and 149 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/131 constraints, ReadFeed: 19/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1)))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p1)))
Knowledge based reduction with 23 factoid took 145 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 24932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(p1 U X(p2))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 351
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 175 transition count 326
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 175 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 109 place count 175 transition count 314
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 129 place count 155 transition count 266
Iterating global reduction 2 with 20 rules applied. Total rules applied 149 place count 155 transition count 266
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 158 place count 155 transition count 257
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 168 place count 145 transition count 229
Iterating global reduction 3 with 10 rules applied. Total rules applied 178 place count 145 transition count 229
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 188 place count 145 transition count 219
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 142 transition count 216
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 142 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 142 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 141 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 141 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 199 place count 141 transition count 212
Applied a total of 199 rules in 19 ms. Remains 141 /221 variables (removed 80) and now considering 212/478 (removed 266) transitions.
// Phase 1: matrix 212 rows 141 cols
[2024-05-31 21:25:48] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:25:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 21:25:48] [INFO ] Invariant cache hit.
[2024-05-31 21:25:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:25:48] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-31 21:25:48] [INFO ] Invariant cache hit.
[2024-05-31 21:25:48] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/353 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 74/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 217 constraints, problems are : Problem set: 0 solved, 211 unsolved in 7220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/353 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 74/217 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 211/428 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 428 constraints, problems are : Problem set: 0 solved, 211 unsolved in 16094 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 23619ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 23626ms
Starting structural reductions in LTL mode, iteration 1 : 141/221 places, 212/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24113 ms. Remains : 141/221 places, 212/478 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 518 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 19 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-03 finished in 24914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 351
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 175 transition count 326
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 175 transition count 326
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 108 place count 175 transition count 315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 156 transition count 270
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 156 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 156 transition count 263
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 145 transition count 226
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 145 transition count 226
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 186 place count 145 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 191 place count 140 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 140 transition count 210
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 136 transition count 206
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 136 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 207 place count 136 transition count 203
Applied a total of 207 rules in 20 ms. Remains 136 /221 variables (removed 85) and now considering 203/478 (removed 275) transitions.
// Phase 1: matrix 203 rows 136 cols
[2024-05-31 21:26:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:26:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:26:13] [INFO ] Invariant cache hit.
[2024-05-31 21:26:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 21:26:13] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-31 21:26:13] [INFO ] Invariant cache hit.
[2024-05-31 21:26:13] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 19791ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 19793ms
Starting structural reductions in LTL mode, iteration 1 : 136/221 places, 203/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20152 ms. Remains : 136/221 places, 203/478 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-06
Product exploration explored 100000 steps with 23002 reset in 178 ms.
Product exploration explored 100000 steps with 23027 reset in 176 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 500 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9219 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1819 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1810 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21996 steps, run visited all 2 properties in 85 ms. (steps per millisecond=258 )
Probabilistic random walk after 21996 steps, saw 10767 distinct states, run finished after 88 ms. (steps per millisecond=249 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-31 21:26:34] [INFO ] Invariant cache hit.
[2024-05-31 21:26:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 21:26:34] [INFO ] Invariant cache hit.
[2024-05-31 21:26:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 21:26:34] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-31 21:26:34] [INFO ] Invariant cache hit.
[2024-05-31 21:26:34] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 20029ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 20035ms
Finished structural reductions in LTL mode , in 1 iterations and 20408 ms. Remains : 136/136 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 500 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9147 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1770 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1779 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21996 steps, run visited all 2 properties in 98 ms. (steps per millisecond=224 )
Probabilistic random walk after 21996 steps, saw 10767 distinct states, run finished after 98 ms. (steps per millisecond=224 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Entered a terminal (fully accepting) state of product in 44892 steps with 10348 reset in 76 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-06 finished in 42656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U (G(p1)||(p1&&G(!p2))))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 196 transition count 367
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 196 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 196 transition count 361
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 176 transition count 336
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 176 transition count 336
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 176 transition count 326
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 125 place count 157 transition count 281
Iterating global reduction 2 with 19 rules applied. Total rules applied 144 place count 157 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 154 place count 157 transition count 271
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 165 place count 146 transition count 235
Iterating global reduction 3 with 11 rules applied. Total rules applied 176 place count 146 transition count 235
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 184 place count 146 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 188 place count 142 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 192 place count 142 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 142 transition count 222
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 195 place count 140 transition count 220
Iterating global reduction 5 with 2 rules applied. Total rules applied 197 place count 140 transition count 220
Applied a total of 197 rules in 49 ms. Remains 140 /221 variables (removed 81) and now considering 220/478 (removed 258) transitions.
// Phase 1: matrix 220 rows 140 cols
[2024-05-31 21:26:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:26:55] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 21:26:55] [INFO ] Invariant cache hit.
[2024-05-31 21:26:55] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-31 21:26:56] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-31 21:26:56] [INFO ] Redundant transitions in 9 ms returned []
Running 219 sub problems to find dead transitions.
[2024-05-31 21:26:56] [INFO ] Invariant cache hit.
[2024-05-31 21:26:56] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/360 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 85/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 227 constraints, problems are : Problem set: 0 solved, 219 unsolved in 6707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/360 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 85/227 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 219/446 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 446 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 22538ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 22540ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/221 places, 220/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22985 ms. Remains : 140/221 places, 220/478 transitions.
Stuttering acceptance computed with spot in 368 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-07
Product exploration explored 100000 steps with 22951 reset in 260 ms.
Product exploration explored 100000 steps with 23152 reset in 236 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 520 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 154 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9257 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1781 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7678 steps, run visited all 1 properties in 35 ms. (steps per millisecond=219 )
Probabilistic random walk after 7678 steps, saw 3553 distinct states, run finished after 35 ms. (steps per millisecond=219 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 39 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-07 finished in 24385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 337
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 337
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 194 transition count 332
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 80 place count 173 transition count 307
Iterating global reduction 1 with 21 rules applied. Total rules applied 101 place count 173 transition count 307
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 173 transition count 297
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 132 place count 152 transition count 255
Iterating global reduction 2 with 21 rules applied. Total rules applied 153 place count 152 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 162 place count 152 transition count 246
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 140 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 140 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 140 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 198 place count 134 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 134 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 134 transition count 201
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 209 place count 130 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 130 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 130 transition count 194
Applied a total of 216 rules in 13 ms. Remains 130 /221 variables (removed 91) and now considering 194/478 (removed 284) transitions.
// Phase 1: matrix 194 rows 130 cols
[2024-05-31 21:27:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:27:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:27:20] [INFO ] Invariant cache hit.
[2024-05-31 21:27:20] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-31 21:27:20] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-31 21:27:20] [INFO ] Invariant cache hit.
[2024-05-31 21:27:20] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/324 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 202 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/324 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 193/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 395 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 20091ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 20093ms
Starting structural reductions in LTL mode, iteration 1 : 130/221 places, 194/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20480 ms. Remains : 130/221 places, 194/478 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 20671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(F(G(p1)) U p2))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 195 transition count 350
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 173 transition count 327
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 173 transition count 327
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 117 place count 173 transition count 312
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 152 transition count 263
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 152 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 152 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 180 place count 140 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 140 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 140 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 202 place count 134 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 208 place count 134 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 134 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 130 transition count 200
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 130 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 220 place count 130 transition count 197
Applied a total of 220 rules in 24 ms. Remains 130 /221 variables (removed 91) and now considering 197/478 (removed 281) transitions.
// Phase 1: matrix 197 rows 130 cols
[2024-05-31 21:27:40] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:27:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:27:40] [INFO ] Invariant cache hit.
[2024-05-31 21:27:40] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-31 21:27:41] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-31 21:27:41] [INFO ] Invariant cache hit.
[2024-05-31 21:27:41] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/327 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 69/201 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-31 21:27:44] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-05-31 21:27:44] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 203 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8802 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/327 variables, 130/134 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 69/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 196/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 399 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints]
After SMT, in 21415ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 21418ms
Starting structural reductions in LTL mode, iteration 1 : 130/221 places, 197/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21787 ms. Remains : 130/221 places, 197/478 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-09 finished in 22008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p0 U p1)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 344
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 194 transition count 340
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 172 transition count 313
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 172 transition count 313
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 114 place count 172 transition count 301
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 134 place count 152 transition count 261
Iterating global reduction 2 with 20 rules applied. Total rules applied 154 place count 152 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 162 place count 152 transition count 253
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 140 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 140 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 196 place count 140 transition count 204
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 201 place count 135 transition count 199
Iterating global reduction 4 with 5 rules applied. Total rules applied 206 place count 135 transition count 199
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 210 place count 131 transition count 195
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 131 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 217 place count 131 transition count 192
Applied a total of 217 rules in 23 ms. Remains 131 /221 variables (removed 90) and now considering 192/478 (removed 286) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-31 21:28:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:28:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:28:02] [INFO ] Invariant cache hit.
[2024-05-31 21:28:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:28:03] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-31 21:28:03] [INFO ] Redundant transitions in 3 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-31 21:28:03] [INFO ] Invariant cache hit.
[2024-05-31 21:28:03] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17215ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/221 places, 192/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17602 ms. Remains : 131/221 places, 192/478 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10
Product exploration explored 100000 steps with 22951 reset in 174 ms.
Product exploration explored 100000 steps with 22989 reset in 309 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (9164 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1773 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1710 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1712 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1738 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1788 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 23631 steps, run visited all 5 properties in 122 ms. (steps per millisecond=193 )
Probabilistic random walk after 23631 steps, saw 11486 distinct states, run finished after 122 ms. (steps per millisecond=193 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 11 factoid took 240 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:28:21] [INFO ] Invariant cache hit.
[2024-05-31 21:28:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:28:21] [INFO ] Invariant cache hit.
[2024-05-31 21:28:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:28:22] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-31 21:28:22] [INFO ] Redundant transitions in 2 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-31 21:28:22] [INFO ] Invariant cache hit.
[2024-05-31 21:28:22] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17232ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17597 ms. Remains : 131/131 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9161 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1827 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1751 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1788 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1737 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1732 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 23631 steps, run visited all 5 properties in 102 ms. (steps per millisecond=231 )
Probabilistic random walk after 23631 steps, saw 11486 distinct states, run finished after 102 ms. (steps per millisecond=231 ) properties seen :5
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 281 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22867 reset in 196 ms.
Product exploration explored 100000 steps with 22928 reset in 184 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:28:40] [INFO ] Invariant cache hit.
[2024-05-31 21:28:41] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 21:28:41] [INFO ] Invariant cache hit.
[2024-05-31 21:28:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:28:41] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-31 21:28:41] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-31 21:28:41] [INFO ] Invariant cache hit.
[2024-05-31 21:28:41] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 66/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 16753ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 16755ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17173 ms. Remains : 131/131 places, 192/192 transitions.
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 55429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!(X(p0) U p1)&&!p2) U (G(p2)&&p3)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 353
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 353
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 195 transition count 347
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 174 transition count 321
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 174 transition count 321
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 113 place count 174 transition count 308
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 154 transition count 261
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 154 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 160 place count 154 transition count 254
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 171 place count 143 transition count 222
Iterating global reduction 3 with 11 rules applied. Total rules applied 182 place count 143 transition count 222
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 192 place count 143 transition count 212
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 197 place count 138 transition count 207
Iterating global reduction 4 with 5 rules applied. Total rules applied 202 place count 138 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 138 transition count 206
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 207 place count 134 transition count 202
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 134 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 213 place count 134 transition count 200
Applied a total of 213 rules in 23 ms. Remains 134 /221 variables (removed 87) and now considering 200/478 (removed 278) transitions.
// Phase 1: matrix 200 rows 134 cols
[2024-05-31 21:28:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:28:58] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-31 21:28:58] [INFO ] Invariant cache hit.
[2024-05-31 21:28:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:28:58] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-31 21:28:58] [INFO ] Redundant transitions in 1 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-31 21:28:58] [INFO ] Invariant cache hit.
[2024-05-31 21:28:58] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/334 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 210 constraints, problems are : Problem set: 0 solved, 199 unsolved in 5526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/334 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/210 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 199/409 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 409 constraints, problems are : Problem set: 0 solved, 199 unsolved in 13312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 19109ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 19113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/221 places, 200/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19575 ms. Remains : 134/221 places, 200/478 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p2), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-11
Stuttering criterion allowed to conclude after 47 steps with 19 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-11 finished in 19733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 292
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 243
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 150 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 138 transition count 202
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 138 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 196
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 190
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 128 transition count 185
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 128 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 128 transition count 182
Applied a total of 221 rules in 11 ms. Remains 128 /221 variables (removed 93) and now considering 182/478 (removed 296) transitions.
// Phase 1: matrix 182 rows 128 cols
[2024-05-31 21:29:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:29:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 21:29:18] [INFO ] Invariant cache hit.
[2024-05-31 21:29:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:29:18] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:29:18] [INFO ] Invariant cache hit.
[2024-05-31 21:29:18] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 191 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 181/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 372 constraints, problems are : Problem set: 0 solved, 181 unsolved in 13300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 19883ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 19885ms
Starting structural reductions in LTL mode, iteration 1 : 128/221 places, 182/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20243 ms. Remains : 128/221 places, 182/478 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-12
Product exploration explored 100000 steps with 22947 reset in 146 ms.
Product exploration explored 100000 steps with 22991 reset in 148 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9156 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1794 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42541 steps, run visited all 1 properties in 90 ms. (steps per millisecond=472 )
Probabilistic random walk after 42541 steps, saw 19880 distinct states, run finished after 90 ms. (steps per millisecond=472 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-12 finished in 21032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 310
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 249
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 249
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 150 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 180 place count 138 transition count 202
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 138 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 198 place count 138 transition count 196
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 203 place count 133 transition count 191
Iterating global reduction 4 with 5 rules applied. Total rules applied 208 place count 133 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 133 transition count 190
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 212 place count 130 transition count 187
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 130 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 130 transition count 186
Applied a total of 216 rules in 22 ms. Remains 130 /221 variables (removed 91) and now considering 186/478 (removed 292) transitions.
// Phase 1: matrix 186 rows 130 cols
[2024-05-31 21:29:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:29:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:29:39] [INFO ] Invariant cache hit.
[2024-05-31 21:29:39] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:29:39] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-31 21:29:39] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 21:29:39] [INFO ] Invariant cache hit.
[2024-05-31 21:29:39] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 19524ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19526ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/221 places, 186/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19888 ms. Remains : 130/221 places, 186/478 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-13
Product exploration explored 100000 steps with 22855 reset in 144 ms.
Product exploration explored 100000 steps with 22950 reset in 150 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9241 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1701 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 51 ms. (steps per millisecond=437 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 51 ms. (steps per millisecond=437 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 186/186 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 21:29:59] [INFO ] Invariant cache hit.
[2024-05-31 21:29:59] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 21:29:59] [INFO ] Invariant cache hit.
[2024-05-31 21:29:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:30:00] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-31 21:30:00] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 21:30:00] [INFO ] Invariant cache hit.
[2024-05-31 21:30:00] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4822 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 19642ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20021 ms. Remains : 130/130 places, 186/186 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9168 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1788 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 51 ms. (steps per millisecond=437 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 51 ms. (steps per millisecond=437 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23033 reset in 146 ms.
Product exploration explored 100000 steps with 22989 reset in 151 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 21:30:20] [INFO ] Invariant cache hit.
[2024-05-31 21:30:20] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:30:20] [INFO ] Invariant cache hit.
[2024-05-31 21:30:20] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:30:21] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-31 21:30:21] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 21:30:21] [INFO ] Invariant cache hit.
[2024-05-31 21:30:21] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 19399ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19401ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19749 ms. Remains : 130/130 places, 186/186 transitions.
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-13 finished in 61586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0)) U p2)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 343
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 194 transition count 341
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 172 transition count 314
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 172 transition count 314
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 172 transition count 302
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 132 place count 152 transition count 264
Iterating global reduction 2 with 20 rules applied. Total rules applied 152 place count 152 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 152 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 141 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 141 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 141 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 198 place count 136 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 203 place count 136 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 136 transition count 209
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 207 place count 133 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 133 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 133 transition count 204
Applied a total of 212 rules in 10 ms. Remains 133 /221 variables (removed 88) and now considering 204/478 (removed 274) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-31 21:30:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:30:40] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-31 21:30:40] [INFO ] Invariant cache hit.
[2024-05-31 21:30:40] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:30:40] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:30:40] [INFO ] Invariant cache hit.
[2024-05-31 21:30:40] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-31 21:30:44] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 215 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/337 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 79/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 203/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 418 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 22728ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 22730ms
Starting structural reductions in LTL mode, iteration 1 : 133/221 places, 204/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23115 ms. Remains : 133/221 places, 204/478 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-14 finished in 23290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 292
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 243
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 150 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 138 transition count 203
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 138 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 197
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 191
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 190
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 128 transition count 186
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 128 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 128 transition count 183
Applied a total of 221 rules in 23 ms. Remains 128 /221 variables (removed 93) and now considering 183/478 (removed 295) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-31 21:31:03] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:31:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 21:31:03] [INFO ] Invariant cache hit.
[2024-05-31 21:31:04] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-31 21:31:04] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-31 21:31:04] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-31 21:31:04] [INFO ] Invariant cache hit.
[2024-05-31 21:31:04] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 18319ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/221 places, 183/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18687 ms. Remains : 128/221 places, 183/478 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-15
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-15 finished in 18732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p0 U p1)))))'
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)))'
[2024-05-31 21:31:22] [INFO ] Flatten gal took : 24 ms
[2024-05-31 21:31:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:31:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 221 places, 478 transitions and 1881 arcs took 6 ms.
Total runtime 444784 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717191267166

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DBSingleClientW-PT-d2m06-LTLFireability-10
ltl formula formula --ltl=/tmp/1450/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 221 places, 478 transitions and 1881 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1450/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1450/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1450/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1450/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 222 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 222, there are 503 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~43 levels ~10000 states ~29072 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~245!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11321
pnml2lts-mc( 0/ 4): unique states count: 11875
pnml2lts-mc( 0/ 4): unique transitions count: 35175
pnml2lts-mc( 0/ 4): - self-loop count: 19855
pnml2lts-mc( 0/ 4): - claim dead count: 1694
pnml2lts-mc( 0/ 4): - claim found count: 155
pnml2lts-mc( 0/ 4): - claim success count: 11899
pnml2lts-mc( 0/ 4): - cum. max stack depth: 458
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11899 states 35271 transitions, fanout: 2.964
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 79327, Transitions per second: 235140
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 12.1 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 490 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d2m06-LTLFireability-13
ltl formula formula --ltl=/tmp/1450/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 221 places, 478 transitions and 1881 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1450/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1450/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1450/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1450/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 223 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 222, there are 481 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~244 levels ~10000 states ~21776 transitions
pnml2lts-mc( 0/ 4): ~308 levels ~20000 states ~41800 transitions
pnml2lts-mc( 0/ 4): ~308 levels ~40000 states ~81052 transitions
pnml2lts-mc( 3/ 4): ~146 levels ~80000 states ~169872 transitions
pnml2lts-mc( 3/ 4): ~159 levels ~160000 states ~349160 transitions
pnml2lts-mc( 1/ 4): ~282 levels ~320000 states ~827908 transitions
pnml2lts-mc( 0/ 4): ~18715 levels ~640000 states ~1611172 transitions
pnml2lts-mc( 1/ 4): ~2457 levels ~1280000 states ~3201124 transitions
pnml2lts-mc( 1/ 4): ~2708 levels ~2560000 states ~7185596 transitions
pnml2lts-mc( 1/ 4): ~7713 levels ~5120000 states ~13812744 transitions
pnml2lts-mc( 1/ 4): ~16467 levels ~10240000 states ~30503836 transitions
pnml2lts-mc( 1/ 4): ~17445 levels ~20480000 states ~70508312 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31802115
pnml2lts-mc( 0/ 4): unique states count: 33382526
pnml2lts-mc( 0/ 4): unique transitions count: 106328207
pnml2lts-mc( 0/ 4): - self-loop count: 23548258
pnml2lts-mc( 0/ 4): - claim dead count: 44417401
pnml2lts-mc( 0/ 4): - claim found count: 5071476
pnml2lts-mc( 0/ 4): - claim success count: 33443436
pnml2lts-mc( 0/ 4): - cum. max stack depth: 130697
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33502291 states 107369724 transitions, fanout: 3.205
pnml2lts-mc( 0/ 4): Total exploration time 182.970 sec (182.960 sec minimum, 182.965 sec on average)
pnml2lts-mc( 0/ 4): States per second: 183103, Transitions per second: 586816
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 263.9MB, 8.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/12.0%
pnml2lts-mc( 0/ 4): Stored 490 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 263.9MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189500564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;