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.r091-tall-171624188000588.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 greatspnxred
Input is DBSingleClientW-PT-d2m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188000588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716305602070

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:33:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:33:23] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-21 15:33:23] [INFO ] Transformed 4763 places.
[2024-05-21 15:33:23] [INFO ] Transformed 2478 transitions.
[2024-05-21 15:33:23] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 325 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 5 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 376 places :
Symmetric choice reduction at 1 with 376 rule applications. Total rules 621 place count 761 transition count 1349
Iterating global reduction 1 with 376 rules applied. Total rules applied 997 place count 761 transition count 1349
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1033 place count 761 transition count 1313
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1332 place count 462 transition count 1014
Iterating global reduction 2 with 299 rules applied. Total rules applied 1631 place count 462 transition count 1014
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1637 place count 462 transition count 1008
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 1860 place count 239 transition count 696
Iterating global reduction 3 with 223 rules applied. Total rules applied 2083 place count 239 transition count 696
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Iterating post reduction 3 with 227 rules applied. Total rules applied 2310 place count 239 transition count 469
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2326 place count 223 transition count 438
Iterating global reduction 4 with 16 rules applied. Total rules applied 2342 place count 223 transition count 438
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2346 place count 223 transition count 434
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2357 place count 212 transition count 423
Iterating global reduction 5 with 11 rules applied. Total rules applied 2368 place count 212 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2370 place count 212 transition count 421
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2380 place count 202 transition count 411
Iterating global reduction 6 with 10 rules applied. Total rules applied 2390 place count 202 transition count 411
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2397 place count 202 transition count 404
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2399 place count 200 transition count 400
Iterating global reduction 7 with 2 rules applied. Total rules applied 2401 place count 200 transition count 400
Applied a total of 2401 rules in 197 ms. Remains 200 /1183 variables (removed 983) and now considering 400/2478 (removed 2078) transitions.
// Phase 1: matrix 400 rows 200 cols
[2024-05-21 15:33:24] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 15:33:24] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-21 15:33:24] [INFO ] Invariant cache hit.
[2024-05-21 15:33:24] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 15:33:24] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-21 15:33:25] [INFO ] Invariant cache hit.
[2024-05-21 15:33:25] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/600 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 209/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 0/600 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 411 constraints, problems are : Problem set: 0 solved, 399 unsolved in 22491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/600 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 209/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 399/810 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 810 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints]
After SMT, in 53771ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 53830ms
Starting structural reductions in LTL mode, iteration 1 : 200/1183 places, 400/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54988 ms. Remains : 200/1183 places, 400/2478 transitions.
Support contains 29 out of 200 places after structural reductions.
[2024-05-21 15:34:19] [INFO ] Flatten gal took : 60 ms
[2024-05-21 15:34:19] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:34:19] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 28 out of 200 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (9197 resets) in 3414 ms. (11 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (176 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (391 resets) in 60 ms. (65 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (397 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (430 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (397 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (170 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (188 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (185 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (196 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (176 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (183 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (364 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (184 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (406 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (205 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (159 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (412 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (180 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (180 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (173 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (176 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (169 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (175 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (190 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (392 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 27357 steps, run visited all 25 properties in 355 ms. (steps per millisecond=77 )
Probabilistic random walk after 27357 steps, saw 12213 distinct states, run finished after 360 ms. (steps per millisecond=75 ) properties seen :25
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 806 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(p2))))))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 321
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 180 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 162 transition count 296
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 162 transition count 296
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 91 place count 162 transition count 282
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 150 transition count 257
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 150 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 150 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 235
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 149 place count 140 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 152 place count 137 transition count 221
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 137 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 137 transition count 218
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 136 transition count 217
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 136 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 163 place count 136 transition count 214
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 165 place count 134 transition count 202
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 134 transition count 202
Applied a total of 167 rules in 44 ms. Remains 134 /200 variables (removed 66) and now considering 202/400 (removed 198) transitions.
// Phase 1: matrix 202 rows 134 cols
[2024-05-21 15:34:21] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 15:34:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 15:34:21] [INFO ] Invariant cache hit.
[2024-05-21 15:34:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 15:34:21] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 15:34:21] [INFO ] Invariant cache hit.
[2024-05-21 15:34:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 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/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16380 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22213ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22219ms
Starting structural reductions in LTL mode, iteration 1 : 134/200 places, 202/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22696 ms. Remains : 134/200 places, 202/400 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-00
Product exploration explored 100000 steps with 22984 reset in 280 ms.
Product exploration explored 100000 steps with 22986 reset in 228 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 edges and 134 vertex of which 133 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 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9202 resets) in 666 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3787 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3845 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1832 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3771 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 167 ms. (steps per millisecond=103 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 168 ms. (steps per millisecond=102 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 15:34:46] [INFO ] Invariant cache hit.
[2024-05-21 15:34:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 15:34:46] [INFO ] Invariant cache hit.
[2024-05-21 15:34:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 15:34:47] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 15:34:47] [INFO ] Invariant cache hit.
[2024-05-21 15:34:47] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5722 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 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/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22048ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22051ms
Finished structural reductions in LTL mode , in 1 iterations and 22498 ms. Remains : 134/134 places, 202/202 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9164 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3892 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3725 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1739 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3909 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 93 ms. (steps per millisecond=185 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 94 ms. (steps per millisecond=183 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22929 reset in 171 ms.
Product exploration explored 100000 steps with 22889 reset in 164 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 23 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 15:35:11] [INFO ] Redundant transitions in 6 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 15:35:11] [INFO ] Invariant cache hit.
[2024-05-21 15:35:11] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5666 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 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/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 21981ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 21984ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22019 ms. Remains : 134/134 places, 202/202 transitions.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 15:35:33] [INFO ] Invariant cache hit.
[2024-05-21 15:35:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 15:35:33] [INFO ] Invariant cache hit.
[2024-05-21 15:35:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 15:35:34] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 15:35:34] [INFO ] Invariant cache hit.
[2024-05-21 15:35:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 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/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22662ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22664ms
Finished structural reductions in LTL mode , in 1 iterations and 23106 ms. Remains : 134/134 places, 202/202 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-00 finished in 95782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F((!p0||G(!p1)))) U p2))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 314
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 312
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 289
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 289
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 87 place count 163 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 152 transition count 259
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 152 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 152 transition count 256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 123 place count 141 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 134 place count 141 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 140 place count 141 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 144 place count 137 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 137 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 137 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 136 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 136 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 136 transition count 215
Applied a total of 157 rules in 19 ms. Remains 136 /200 variables (removed 64) and now considering 215/400 (removed 185) transitions.
// Phase 1: matrix 215 rows 136 cols
[2024-05-21 15:35:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 15:35:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 15:35:56] [INFO ] Invariant cache hit.
[2024-05-21 15:35:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 15:35:57] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-21 15:35:57] [INFO ] Invariant cache hit.
[2024-05-21 15:35:57] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/351 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 90/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/351 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 228 constraints, problems are : Problem set: 0 solved, 214 unsolved in 6694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/351 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 90/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 214/442 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 442 constraints, problems are : Problem set: 0 solved, 214 unsolved in 18696 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 25713ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 25717ms
Starting structural reductions in LTL mode, iteration 1 : 136/200 places, 215/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26090 ms. Remains : 136/200 places, 215/400 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-01 finished in 26354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 328
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 179 transition count 325
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 160 transition count 300
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 160 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 98 place count 160 transition count 285
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 148 transition count 259
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 148 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 126 place count 148 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 137 place count 137 transition count 229
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 137 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 153 place count 137 transition count 224
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 157 place count 133 transition count 220
Iterating global reduction 4 with 4 rules applied. Total rules applied 161 place count 133 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 133 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 132 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 132 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 170 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 173 place count 129 transition count 192
Iterating global reduction 6 with 3 rules applied. Total rules applied 176 place count 129 transition count 192
Applied a total of 176 rules in 21 ms. Remains 129 /200 variables (removed 71) and now considering 192/400 (removed 208) transitions.
// Phase 1: matrix 192 rows 129 cols
[2024-05-21 15:36:23] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 15:36:23] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 15:36:23] [INFO ] Invariant cache hit.
[2024-05-21 15:36:23] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 15:36:23] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-21 15:36:23] [INFO ] Invariant cache hit.
[2024-05-21 15:36:23] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/321 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 4914 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/321 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17522ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17524ms
Starting structural reductions in LTL mode, iteration 1 : 129/200 places, 192/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17884 ms. Remains : 129/200 places, 192/400 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 18023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||G(p2)||p0)))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 320
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 318
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 295
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 295
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 90 place count 163 transition count 281
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 153 transition count 261
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 153 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 153 transition count 258
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 144 transition count 241
Iterating global reduction 3 with 9 rules applied. Total rules applied 131 place count 144 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 144 transition count 236
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 141 transition count 233
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 141 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 141 transition count 229
Applied a total of 146 rules in 8 ms. Remains 141 /200 variables (removed 59) and now considering 229/400 (removed 171) transitions.
// Phase 1: matrix 229 rows 141 cols
[2024-05-21 15:36:41] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 15:36:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 15:36:41] [INFO ] Invariant cache hit.
[2024-05-21 15:36:41] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-21 15:36:41] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 15:36:41] [INFO ] Invariant cache hit.
[2024-05-21 15:36:41] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/370 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 97/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 240 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/370 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 97/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 228/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 468 constraints, problems are : Problem set: 0 solved, 228 unsolved in 20826 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 28493ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 28497ms
Starting structural reductions in LTL mode, iteration 1 : 141/200 places, 229/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28933 ms. Remains : 141/200 places, 229/400 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 304 ms.
Product exploration explored 100000 steps with 33333 reset in 219 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 528 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 49 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 29687 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 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 178 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 159 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 159 transition count 285
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 98 place count 159 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 146 transition count 244
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 146 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 146 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 140 place count 134 transition count 212
Iterating global reduction 3 with 12 rules applied. Total rules applied 152 place count 134 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 158 place count 134 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 130 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 130 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 170 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 129 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 129 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 175 place count 129 transition count 194
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 177 place count 127 transition count 182
Iterating global reduction 6 with 2 rules applied. Total rules applied 179 place count 127 transition count 182
Applied a total of 179 rules in 49 ms. Remains 127 /200 variables (removed 73) and now considering 182/400 (removed 218) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 15:37:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 15:37:11] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 15:37:11] [INFO ] Invariant cache hit.
[2024-05-21 15:37:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 15:37:11] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-21 15:37:11] [INFO ] Redundant transitions in 5 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 15:37:11] [INFO ] Invariant cache hit.
[2024-05-21 15:37:11] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 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/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16671ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/200 places, 182/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17386 ms. Remains : 127/200 places, 182/400 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-08
Product exploration explored 100000 steps with 22939 reset in 129 ms.
Product exploration explored 100000 steps with 22992 reset in 133 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 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 79 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9134 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3826 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 37 ms. (steps per millisecond=561 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 37 ms. (steps per millisecond=561 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 15:37:29] [INFO ] Invariant cache hit.
[2024-05-21 15:37:29] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 15:37:29] [INFO ] Invariant cache hit.
[2024-05-21 15:37:29] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 15:37:29] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-21 15:37:29] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 15:37:29] [INFO ] Invariant cache hit.
[2024-05-21 15:37:29] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5729 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 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/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16550ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16551ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16984 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9217 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3746 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 36 ms. (steps per millisecond=577 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 36 ms. (steps per millisecond=577 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22930 reset in 139 ms.
Product exploration explored 100000 steps with 22993 reset in 134 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 15:37:47] [INFO ] Invariant cache hit.
[2024-05-21 15:37:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 15:37:47] [INFO ] Invariant cache hit.
[2024-05-21 15:37:47] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 15:37:47] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-21 15:37:47] [INFO ] Redundant transitions in 5 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 15:37:47] [INFO ] Invariant cache hit.
[2024-05-21 15:37:47] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5881 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 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/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16469ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16915 ms. Remains : 127/127 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-08 finished in 53163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 321
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 178 transition count 318
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 158 transition count 292
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 158 transition count 292
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 103 place count 158 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 146 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 146 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 146 transition count 252
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 143 place count 134 transition count 224
Iterating global reduction 3 with 12 rules applied. Total rules applied 155 place count 134 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 134 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 165 place count 130 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 169 place count 130 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 173 place count 130 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 174 place count 129 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 129 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 129 transition count 206
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 181 place count 126 transition count 186
Iterating global reduction 6 with 3 rules applied. Total rules applied 184 place count 126 transition count 186
Applied a total of 184 rules in 13 ms. Remains 126 /200 variables (removed 74) and now considering 186/400 (removed 214) transitions.
// Phase 1: matrix 186 rows 126 cols
[2024-05-21 15:38:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 15:38:04] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-21 15:38:04] [INFO ] Invariant cache hit.
[2024-05-21 15:38:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 15:38:04] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 15:38:04] [INFO ] Invariant cache hit.
[2024-05-21 15:38:04] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 195 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 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/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 380 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 17758ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 17760ms
Starting structural reductions in LTL mode, iteration 1 : 126/200 places, 186/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18439 ms. Remains : 126/200 places, 186/400 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09
Product exploration explored 100000 steps with 23037 reset in 139 ms.
Product exploration explored 100000 steps with 22808 reset in 149 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 460 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 93 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9250 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14627 steps, run visited all 1 properties in 27 ms. (steps per millisecond=541 )
Probabilistic random walk after 14627 steps, saw 7153 distinct states, run finished after 27 ms. (steps per millisecond=541 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 118 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-d2m09-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 19260 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||G(p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 311
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 291
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 94 place count 161 transition count 277
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 149 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 149 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 149 transition count 247
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 138 transition count 220
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 138 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 153 place count 134 transition count 211
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 134 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 161 place count 134 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 133 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 133 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 166 place count 133 transition count 203
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 130 transition count 183
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 130 transition count 183
Applied a total of 172 rules in 36 ms. Remains 130 /200 variables (removed 70) and now considering 183/400 (removed 217) transitions.
// Phase 1: matrix 183 rows 130 cols
[2024-05-21 15:38:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:38:23] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 15:38:23] [INFO ] Invariant cache hit.
[2024-05-21 15:38:23] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 15:38:23] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-21 15:38:23] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 15:38:23] [INFO ] Invariant cache hit.
[2024-05-21 15:38:23] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/313 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 186 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 54/54 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/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/313 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 182/368 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 368 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 18136ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/200 places, 183/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18663 ms. Remains : 130/200 places, 183/400 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1064 steps with 240 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-10 finished in 18828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U ((p1 U p2) U p3))))||X((X(p1) U p0))))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 328
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 326
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 304
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 304
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 90 place count 163 transition count 290
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 152 transition count 267
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 152 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 152 transition count 265
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 124 place count 142 transition count 239
Iterating global reduction 3 with 10 rules applied. Total rules applied 134 place count 142 transition count 239
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 150 place count 142 transition count 223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 140 transition count 221
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 140 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 140 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 139 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 139 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 139 transition count 216
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 137 transition count 203
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 137 transition count 203
Applied a total of 164 rules in 21 ms. Remains 137 /200 variables (removed 63) and now considering 203/400 (removed 197) transitions.
// Phase 1: matrix 203 rows 137 cols
[2024-05-21 15:38:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:38:42] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 15:38:42] [INFO ] Invariant cache hit.
[2024-05-21 15:38:42] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 15:38:42] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 15:38:42] [INFO ] Invariant cache hit.
[2024-05-21 15:38:42] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/340 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 70/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 209 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5350 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 70/70 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/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/340 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 70/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 202/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 411 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16472 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 22089ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 22096ms
Starting structural reductions in LTL mode, iteration 1 : 137/200 places, 203/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22656 ms. Remains : 137/200 places, 203/400 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-12 finished in 23034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 325
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 299
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 299
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 92 place count 161 transition count 287
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 103 place count 150 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 114 place count 150 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 150 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 140 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 136 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 136 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 154 place count 136 transition count 223
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 135 transition count 222
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 135 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 159 place count 135 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 162 place count 132 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 165 place count 132 transition count 199
Applied a total of 165 rules in 29 ms. Remains 132 /200 variables (removed 68) and now considering 199/400 (removed 201) transitions.
// Phase 1: matrix 199 rows 132 cols
[2024-05-21 15:39:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 15:39:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 15:39:05] [INFO ] Invariant cache hit.
[2024-05-21 15:39:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 15:39:05] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-21 15:39:05] [INFO ] Redundant transitions in 0 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 15:39:05] [INFO ] Invariant cache hit.
[2024-05-21 15:39:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 20252ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20255ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/200 places, 199/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20696 ms. Remains : 132/200 places, 199/400 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13
Product exploration explored 100000 steps with 23087 reset in 152 ms.
Product exploration explored 100000 steps with 23026 reset in 159 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9220 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1814 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1808 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1743 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1784 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21179 steps, run visited all 4 properties in 204 ms. (steps per millisecond=103 )
Probabilistic random walk after 21179 steps, saw 10442 distinct states, run finished after 204 ms. (steps per millisecond=103 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 199/199 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 15:39:27] [INFO ] Invariant cache hit.
[2024-05-21 15:39:27] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 15:39:27] [INFO ] Invariant cache hit.
[2024-05-21 15:39:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 15:39:27] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 15:39:27] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 15:39:27] [INFO ] Invariant cache hit.
[2024-05-21 15:39:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 20314ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20676 ms. Remains : 132/132 places, 199/199 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9246 resets) in 407 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1749 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1820 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1830 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1795 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21179 steps, run visited all 4 properties in 228 ms. (steps per millisecond=92 )
Probabilistic random walk after 21179 steps, saw 10442 distinct states, run finished after 228 ms. (steps per millisecond=92 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22967 reset in 179 ms.
Product exploration explored 100000 steps with 23050 reset in 170 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 15:39:49] [INFO ] Invariant cache hit.
[2024-05-21 15:39:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 15:39:49] [INFO ] Invariant cache hit.
[2024-05-21 15:39:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 15:39:49] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 15:39:49] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 15:39:49] [INFO ] Invariant cache hit.
[2024-05-21 15:39:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 20177ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20544 ms. Remains : 132/132 places, 199/199 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 64711 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(((p2 U p0)&&p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 326
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 180 transition count 325
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 162 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 162 transition count 301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 90 place count 162 transition count 288
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 151 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 151 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 151 transition count 259
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 142 transition count 243
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 142 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 138 place count 142 transition count 239
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 142 place count 138 transition count 235
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 138 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 150 place count 138 transition count 231
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 137 transition count 230
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 137 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 155 place count 137 transition count 227
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 158 place count 134 transition count 207
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 134 transition count 207
Applied a total of 161 rules in 18 ms. Remains 134 /200 variables (removed 66) and now considering 207/400 (removed 193) transitions.
// Phase 1: matrix 207 rows 134 cols
[2024-05-21 15:40:09] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 15:40:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 15:40:10] [INFO ] Invariant cache hit.
[2024-05-21 15:40:10] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 15:40:10] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-21 15:40:10] [INFO ] Invariant cache hit.
[2024-05-21 15:40:10] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/341 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 81/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 217 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/341 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 81/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 206/423 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 423 constraints, problems are : Problem set: 0 solved, 206 unsolved in 16305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 22457ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 22459ms
Starting structural reductions in LTL mode, iteration 1 : 134/200 places, 207/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22856 ms. Remains : 134/200 places, 207/400 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 23097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 320
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 318
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 295
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 295
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 94 place count 161 transition count 281
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 149 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 149 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 149 transition count 252
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 138 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 138 transition count 225
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 155 place count 138 transition count 214
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 135 transition count 211
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 134 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 171 place count 132 transition count 192
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 132 transition count 192
Applied a total of 173 rules in 19 ms. Remains 132 /200 variables (removed 68) and now considering 192/400 (removed 208) transitions.
// Phase 1: matrix 192 rows 132 cols
[2024-05-21 15:40:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 15:40:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 15:40:33] [INFO ] Invariant cache hit.
[2024-05-21 15:40:33] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-21 15:40:33] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-21 15:40:33] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 15:40:33] [INFO ] Invariant cache hit.
[2024-05-21 15:40:33] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 65/65 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/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 19421ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 19424ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/200 places, 192/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19951 ms. Remains : 132/200 places, 192/400 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-15 finished in 20062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2024-05-21 15:40:53] [INFO ] Flatten gal took : 23 ms
[2024-05-21 15:40:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:40:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 400 transitions and 1572 arcs took 5 ms.
Total runtime 450248 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 200
TRANSITIONS: 400
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.002s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1494
MODEL NAME: /home/mcc/execution/410/model
200 places, 400 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-d2m09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d2m09, 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 r091-tall-171624188000588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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