Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189600580.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DBSingleClientW-PT-d2m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189600580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 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-d2m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716329582210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:13:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:13:03] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-21 22:13:03] [INFO ] Transformed 4763 places.
[2024-05-21 22:13:03] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:13:03] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 370 places :
Symmetric choice reduction at 1 with 370 rule applications. Total rules 615 place count 767 transition count 1481
Iterating global reduction 1 with 370 rules applied. Total rules applied 985 place count 767 transition count 1481
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 1057 place count 767 transition count 1409
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 1357 place count 467 transition count 1109
Iterating global reduction 2 with 300 rules applied. Total rules applied 1657 place count 467 transition count 1109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1667 place count 467 transition count 1099
Discarding 224 places :
Symmetric choice reduction at 3 with 224 rule applications. Total rules 1891 place count 243 transition count 794
Iterating global reduction 3 with 224 rules applied. Total rules applied 2115 place count 243 transition count 794
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 3 with 284 rules applied. Total rules applied 2399 place count 243 transition count 510
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2416 place count 226 transition count 480
Iterating global reduction 4 with 17 rules applied. Total rules applied 2433 place count 226 transition count 480
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 2465 place count 226 transition count 448
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2473 place count 218 transition count 440
Iterating global reduction 5 with 8 rules applied. Total rules applied 2481 place count 218 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2482 place count 218 transition count 439
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2489 place count 211 transition count 432
Iterating global reduction 6 with 7 rules applied. Total rules applied 2496 place count 211 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2504 place count 211 transition count 424
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2506 place count 209 transition count 420
Iterating global reduction 7 with 2 rules applied. Total rules applied 2508 place count 209 transition count 420
Applied a total of 2508 rules in 198 ms. Remains 209 /1183 variables (removed 974) and now considering 420/2478 (removed 2058) transitions.
// Phase 1: matrix 420 rows 209 cols
[2024-05-21 22:13:04] [INFO ] Computed 2 invariants in 25 ms
[2024-05-21 22:13:04] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 22:13:04] [INFO ] Invariant cache hit.
[2024-05-21 22:13:04] [INFO ] State equation strengthened by 216 read => feed constraints.
[2024-05-21 22:13:05] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-21 22:13:05] [INFO ] Invariant cache hit.
[2024-05-21 22:13:05] [INFO ] State equation strengthened by 216 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 420/629 variables, 209/211 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 216/427 constraints. Problems are: Problem set: 0 solved, 419 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (OVERLAPS) 0/629 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 427 constraints, problems are : Problem set: 0 solved, 419 unsolved in 21751 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 420/629 variables, 209/211 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 216/427 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 419/846 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 846 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
After SMT, in 53092ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 53108ms
Starting structural reductions in LTL mode, iteration 1 : 209/1183 places, 420/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54338 ms. Remains : 209/1183 places, 420/2478 transitions.
Support contains 35 out of 209 places after structural reductions.
[2024-05-21 22:13:58] [INFO ] Flatten gal took : 54 ms
[2024-05-21 22:13:58] [INFO ] Flatten gal took : 27 ms
[2024-05-21 22:13:58] [INFO ] Input system was already deterministic with 420 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (9275 resets) in 2793 ms. (14 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4003 steps (188 resets) in 80 ms. (49 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (196 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (374 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (374 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (184 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (169 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (164 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (161 resets) in 15 ms. (250 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 4001 steps (364 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (169 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (193 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (189 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (186 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (187 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (187 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (196 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (165 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (183 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (173 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (166 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (183 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (188 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (176 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (188 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
[2024-05-21 22:13:59] [INFO ] Invariant cache hit.
[2024-05-21 22:13:59] [INFO ] State equation strengthened by 216 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 76/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 49/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-21 22:14:00] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 12 ms to minimize.
[2024-05-21 22:14:00] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 345/501 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 141/301 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 9 (OVERLAPS) 128/629 variables, 53/354 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 75/429 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/629 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 429 constraints, problems are : Problem set: 1 solved, 24 unsolved in 2852 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 76/106 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 49/155 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-21 22:14:02] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 2 ms to minimize.
[2024-05-21 22:14:02] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 340/495 variables, 155/161 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 136/297 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 2 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:14:04] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:14:04] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:14:04] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-21 22:14:04] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 3 ms to minimize.
[2024-05-21 22:14:04] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 15/312 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 134/629 variables, 54/366 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 80/446 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/629 variables, 24/470 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/629 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 0/629 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 470 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 19/19 constraints]
After SMT, in 8001ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 420/420 transitions.
Graph (complete) has 779 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 208 transition count 415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 204 transition count 406
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 204 transition count 406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 203 transition count 405
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 203 transition count 405
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 202 transition count 404
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 202 transition count 404
Applied a total of 18 rules in 55 ms. Remains 202 /209 variables (removed 7) and now considering 404/420 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 202/209 places, 404/420 transitions.
RANDOM walk for 40000 steps (9215 resets) in 511 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (175 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (185 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (397 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (410 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (153 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (184 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (174 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (179 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (182 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (393 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (188 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (180 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (178 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (199 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (174 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (185 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (164 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (185 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (189 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (192 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (159 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (164 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (152 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (187 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
Probabilistic random walk after 1000001 steps, saw 388158 distinct states, run finished after 2280 ms. (steps per millisecond=438 ) properties seen :23
// Phase 1: matrix 404 rows 202 cols
[2024-05-21 22:14:10] [INFO ] Computed 2 invariants in 10 ms
[2024-05-21 22:14:10] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 218/221 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 380/601 variables, 194/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 186/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/606 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 5/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/606 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 202/202 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 218/221 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 380/601 variables, 194/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 186/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/606 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/606 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 202/202 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 404/404 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 181 transition count 325
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 181 transition count 325
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 181 transition count 322
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 62 place count 164 transition count 299
Iterating global reduction 1 with 17 rules applied. Total rules applied 79 place count 164 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 164 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 98 place count 149 transition count 269
Iterating global reduction 2 with 15 rules applied. Total rules applied 113 place count 149 transition count 269
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 125 place count 149 transition count 257
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 137 place count 137 transition count 228
Iterating global reduction 3 with 12 rules applied. Total rules applied 149 place count 137 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 157 place count 137 transition count 220
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 164 place count 130 transition count 196
Iterating global reduction 4 with 7 rules applied. Total rules applied 171 place count 130 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 175 place count 130 transition count 192
Applied a total of 175 rules in 47 ms. Remains 130 /202 variables (removed 72) and now considering 192/404 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 130/202 places, 192/404 transitions.
RANDOM walk for 40000 steps (9191 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1792 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 62271 steps, run visited all 1 properties in 86 ms. (steps per millisecond=724 )
Probabilistic random walk after 62271 steps, saw 27866 distinct states, run finished after 90 ms. (steps per millisecond=691 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 5 stabilizing places and 29 stable transitions
Graph (complete) has 844 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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(p0)&&F(p1)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 314
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 166 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 166 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 166 transition count 288
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 150 transition count 260
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 150 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 150 transition count 250
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 139 transition count 226
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 139 transition count 226
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 139 transition count 220
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 170 place count 130 transition count 194
Iterating global reduction 4 with 9 rules applied. Total rules applied 179 place count 130 transition count 194
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 185 place count 130 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 186 place count 129 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 129 transition count 187
Applied a total of 187 rules in 19 ms. Remains 129 /209 variables (removed 80) and now considering 187/420 (removed 233) transitions.
// Phase 1: matrix 187 rows 129 cols
[2024-05-21 22:14:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:14:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 22:14:11] [INFO ] Invariant cache hit.
[2024-05-21 22:14:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:14:12] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-05-21 22:14:12] [INFO ] Invariant cache hit.
[2024-05-21 22:14:12] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/316 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 66/197 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-21 22:14:15] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 198 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7350 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/316 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 66/198 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 186/384 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/316 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 384 constraints, problems are : Problem set: 0 solved, 186 unsolved in 10873 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 1/1 constraints]
After SMT, in 18491ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 18495ms
Starting structural reductions in LTL mode, iteration 1 : 129/209 places, 187/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18844 ms. Remains : 129/209 places, 187/420 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-01 finished in 19208 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 U (!p1||G(p1)))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 317
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 315
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 168 transition count 298
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 168 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 168 transition count 296
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 152 transition count 268
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 152 transition count 268
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 129 place count 152 transition count 257
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 140 place count 141 transition count 230
Iterating global reduction 3 with 11 rules applied. Total rules applied 151 place count 141 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 156 place count 141 transition count 225
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 165 place count 132 transition count 199
Iterating global reduction 4 with 9 rules applied. Total rules applied 174 place count 132 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 180 place count 132 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 131 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 131 transition count 192
Applied a total of 182 rules in 39 ms. Remains 131 /209 variables (removed 78) and now considering 192/420 (removed 228) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-21 22:14:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:14:31] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 22:14:31] [INFO ] Invariant cache hit.
[2024-05-21 22:14:31] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:14:31] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-21 22:14:31] [INFO ] Redundant transitions in 7 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 22:14:31] [INFO ] Invariant cache hit.
[2024-05-21 22:14:31] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 195 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/323 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 191/386 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 386 constraints, problems are : Problem set: 0 solved, 191 unsolved in 14072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 19378ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 19380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/209 places, 192/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19778 ms. Remains : 131/209 places, 192/420 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, false, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-02
Product exploration explored 100000 steps with 23006 reset in 280 ms.
Product exploration explored 100000 steps with 22985 reset in 201 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, false, (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (9236 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3749 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3813 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3697 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 2133076 steps, run timeout after 3001 ms. (steps per millisecond=710 ) properties seen :2 out of 3
Probabilistic random walk after 2133076 steps, saw 862431 distinct states, run finished after 3005 ms. (steps per millisecond=709 ) properties seen :2
[2024-05-21 22:14:54] [INFO ] Invariant cache hit.
[2024-05-21 22:14:54] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 57/323 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/131 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 13 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-02 finished in 23886 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(F(p1)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 327
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 325
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 168 transition count 303
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 168 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 168 transition count 301
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 153 transition count 275
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 153 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 126 place count 153 transition count 265
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 137 place count 142 transition count 232
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 142 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 154 place count 142 transition count 226
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 162 place count 134 transition count 201
Iterating global reduction 4 with 8 rules applied. Total rules applied 170 place count 134 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 175 place count 134 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 133 transition count 195
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 133 transition count 195
Applied a total of 177 rules in 36 ms. Remains 133 /209 variables (removed 76) and now considering 195/420 (removed 225) transitions.
// Phase 1: matrix 195 rows 133 cols
[2024-05-21 22:14:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:14:54] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:14:54] [INFO ] Invariant cache hit.
[2024-05-21 22:14:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:14:55] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 22:14:55] [INFO ] Redundant transitions in 8 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 22:14:55] [INFO ] Invariant cache hit.
[2024-05-21 22:14:55] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-21 22:14:58] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 204 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/328 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 68/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 194/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 398 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints]
After SMT, in 21206ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 21211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/209 places, 195/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21583 ms. Remains : 133/209 places, 195/420 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-03
Product exploration explored 100000 steps with 23120 reset in 244 ms.
Product exploration explored 100000 steps with 23023 reset in 177 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 486 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9161 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1825 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1774 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1809 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21301 steps, run visited all 3 properties in 125 ms. (steps per millisecond=170 )
Probabilistic random walk after 21301 steps, saw 10513 distinct states, run finished after 125 ms. (steps per millisecond=170 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 195/195 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 22:15:17] [INFO ] Invariant cache hit.
[2024-05-21 22:15:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 22:15:17] [INFO ] Invariant cache hit.
[2024-05-21 22:15:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:15:18] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-21 22:15:18] [INFO ] Redundant transitions in 3 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 22:15:18] [INFO ] Invariant cache hit.
[2024-05-21 22:15:18] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-21 22:15:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 204 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/328 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 68/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 194/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 398 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints]
After SMT, in 21333ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 21336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21658 ms. Remains : 133/133 places, 195/195 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 486 edges and 133 vertex of which 132 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 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9271 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1800 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1729 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21301 steps, run visited all 3 properties in 112 ms. (steps per millisecond=190 )
Probabilistic random walk after 21301 steps, saw 10513 distinct states, run finished after 112 ms. (steps per millisecond=190 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22931 reset in 165 ms.
Product exploration explored 100000 steps with 23093 reset in 185 ms.
Built C files in :
/tmp/ltsmin16178944099488071826
[2024-05-21 22:15:40] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 22:15:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:15:40] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 22:15:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:15:40] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 22:15:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:15:40] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16178944099488071826
Running compilation step : cd /tmp/ltsmin16178944099488071826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 584 ms.
Running link step : cd /tmp/ltsmin16178944099488071826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16178944099488071826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11458700390452052134.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 195/195 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 22:15:55] [INFO ] Invariant cache hit.
[2024-05-21 22:15:55] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:15:55] [INFO ] Invariant cache hit.
[2024-05-21 22:15:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:15:56] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 22:15:56] [INFO ] Redundant transitions in 2 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 22:15:56] [INFO ] Invariant cache hit.
[2024-05-21 22:15:56] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-21 22:15:59] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 204 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/328 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 68/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 194/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 398 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13413 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints]
After SMT, in 21447ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 21448ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21778 ms. Remains : 133/133 places, 195/195 transitions.
Built C files in :
/tmp/ltsmin6044735067337812009
[2024-05-21 22:16:17] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 22:16:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:16:17] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 22:16:17] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:16:17] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 22:16:17] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:16:17] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6044735067337812009
Running compilation step : cd /tmp/ltsmin6044735067337812009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin6044735067337812009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6044735067337812009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12840963095004092629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:16:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:16:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:16:32] [INFO ] Time to serialize gal into /tmp/LTL1503394307178883855.gal : 3 ms
[2024-05-21 22:16:32] [INFO ] Time to serialize properties into /tmp/LTL4525738802465625366.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1503394307178883855.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13936210935169228339.hoa' '-atoms' '/tmp/LTL4525738802465625366.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4525738802465625366.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13936210935169228339.hoa
Detected timeout of ITS tools.
[2024-05-21 22:16:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:16:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:16:47] [INFO ] Time to serialize gal into /tmp/LTL12073385304409437903.gal : 2 ms
[2024-05-21 22:16:47] [INFO ] Time to serialize properties into /tmp/LTL3220914379959469642.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12073385304409437903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3220914379959469642.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((s1<1)||(l4112<1))")))||("((s1>=1)&&(l3846>=1))"))))
Formula 0 simplified : G(!"((s1>=1)&&(l3846>=1))" & FG!"((s1<1)||(l4112<1))")
Detected timeout of ITS tools.
[2024-05-21 22:17:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:17:02] [INFO ] Applying decomposition
[2024-05-21 22:17:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13917200104327660306.txt' '-o' '/tmp/graph13917200104327660306.bin' '-w' '/tmp/graph13917200104327660306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13917200104327660306.bin' '-l' '-1' '-v' '-w' '/tmp/graph13917200104327660306.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:17:02] [INFO ] Decomposing Gal with order
[2024-05-21 22:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:17:03] [INFO ] Removed a total of 212 redundant transitions.
[2024-05-21 22:17:03] [INFO ] Flatten gal took : 54 ms
[2024-05-21 22:17:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 12 ms.
[2024-05-21 22:17:03] [INFO ] Time to serialize gal into /tmp/LTL6284384336346420505.gal : 4 ms
[2024-05-21 22:17:03] [INFO ] Time to serialize properties into /tmp/LTL8131052929503040680.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6284384336346420505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8131052929503040680.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i4.u2.s1<1)||(i1.u20.l4112<1))")))||("((i4.u2.s1>=1)&&(u17.l3846>=1))"))))
Formula 0 simplified : G(!"((i4.u2.s1>=1)&&(u17.l3846>=1))" & FG!"((i4.u2.s1<1)||(i1.u20.l4112<1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-03 finished in 143287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p2)&&X(p3)&&p1))||p0)))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 334
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 186 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 168 transition count 308
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 168 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 168 transition count 305
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 104 place count 152 transition count 277
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 152 transition count 277
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 133 place count 152 transition count 264
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 141 transition count 241
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 141 transition count 241
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 141 transition count 235
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 169 place count 133 transition count 210
Iterating global reduction 4 with 8 rules applied. Total rules applied 177 place count 133 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 182 place count 133 transition count 205
Applied a total of 182 rules in 13 ms. Remains 133 /209 variables (removed 76) and now considering 205/420 (removed 215) transitions.
// Phase 1: matrix 205 rows 133 cols
[2024-05-21 22:17:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:17:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 22:17:18] [INFO ] Invariant cache hit.
[2024-05-21 22:17:18] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:17:18] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-21 22:17:18] [INFO ] Invariant cache hit.
[2024-05-21 22:17:18] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/338 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 77/212 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 212 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/338 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 77/212 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 204/416 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 416 constraints, problems are : Problem set: 0 solved, 204 unsolved in 15165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 21135ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 21139ms
Starting structural reductions in LTL mode, iteration 1 : 133/209 places, 205/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21504 ms. Remains : 133/209 places, 205/420 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p2), (AND p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-04
Entered a terminal (fully accepting) state of product in 24852 steps with 5688 reset in 44 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-04 finished in 21802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 324
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 322
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 165 transition count 298
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 165 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 111 place count 148 transition count 265
Iterating global reduction 2 with 17 rules applied. Total rules applied 128 place count 148 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 139 place count 148 transition count 254
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 152 place count 135 transition count 218
Iterating global reduction 3 with 13 rules applied. Total rules applied 165 place count 135 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 171 place count 135 transition count 212
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 180 place count 126 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 189 place count 126 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 195 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 125 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 125 transition count 179
Applied a total of 197 rules in 31 ms. Remains 125 /209 variables (removed 84) and now considering 179/420 (removed 241) transitions.
// Phase 1: matrix 179 rows 125 cols
[2024-05-21 22:17:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:17:40] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:17:40] [INFO ] Invariant cache hit.
[2024-05-21 22:17:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 22:17:40] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-21 22:17:40] [INFO ] Invariant cache hit.
[2024-05-21 22:17:40] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 9459 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 14146ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 14148ms
Starting structural reductions in LTL mode, iteration 1 : 125/209 places, 179/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14455 ms. Remains : 125/209 places, 179/420 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-05
Product exploration explored 100000 steps with 23026 reset in 185 ms.
Product exploration explored 100000 steps with 22959 reset in 182 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 453 edges and 125 vertex of which 124 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9279 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1806 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16734 steps, run visited all 1 properties in 30 ms. (steps per millisecond=557 )
Probabilistic random walk after 16734 steps, saw 8268 distinct states, run finished after 30 ms. (steps per millisecond=557 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 101 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-d2m08-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-05 finished in 15255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 314
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 166 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 166 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 166 transition count 288
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 150 transition count 261
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 150 transition count 261
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 150 transition count 251
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 145 place count 138 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 138 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 163 place count 138 transition count 210
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 171 place count 130 transition count 185
Iterating global reduction 4 with 8 rules applied. Total rules applied 179 place count 130 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 184 place count 130 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 129 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 129 transition count 179
Applied a total of 186 rules in 32 ms. Remains 129 /209 variables (removed 80) and now considering 179/420 (removed 241) transitions.
// Phase 1: matrix 179 rows 129 cols
[2024-05-21 22:17:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:17:55] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:17:55] [INFO ] Invariant cache hit.
[2024-05-21 22:17:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 22:17:55] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-21 22:17:55] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 22:17:55] [INFO ] Invariant cache hit.
[2024-05-21 22:17:55] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/308 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 55/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 186 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4587 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/308 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 55/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 178/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 16770ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 16773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/209 places, 179/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17079 ms. Remains : 129/209 places, 179/420 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-06 finished in 17129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1 U p2)||G(p3))))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 187 transition count 337
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 187 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 187 transition count 336
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 171 transition count 319
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 171 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 171 transition count 316
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 94 place count 157 transition count 292
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 157 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 157 transition count 283
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 127 place count 147 transition count 250
Iterating global reduction 3 with 10 rules applied. Total rules applied 137 place count 147 transition count 250
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 147 place count 147 transition count 240
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 153 place count 141 transition count 224
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 141 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 163 place count 141 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 140 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 140 transition count 219
Applied a total of 165 rules in 16 ms. Remains 140 /209 variables (removed 69) and now considering 219/420 (removed 201) transitions.
// Phase 1: matrix 219 rows 140 cols
[2024-05-21 22:18:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:18:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 22:18:12] [INFO ] Invariant cache hit.
[2024-05-21 22:18:12] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:18:12] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 22:18:12] [INFO ] Invariant cache hit.
[2024-05-21 22:18:12] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/359 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 223 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/359 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 218/441 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/359 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 441 constraints, problems are : Problem set: 0 solved, 218 unsolved in 18556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 25361ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 25364ms
Starting structural reductions in LTL mode, iteration 1 : 140/209 places, 219/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25762 ms. Remains : 140/209 places, 219/420 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 521 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 16 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-08 finished in 26574 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(F(p0))&&F(p1))) U G(p2)))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 186 transition count 320
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 169 transition count 298
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 169 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 169 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 100 place count 154 transition count 270
Iterating global reduction 2 with 15 rules applied. Total rules applied 115 place count 154 transition count 270
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 154 transition count 261
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 135 place count 143 transition count 234
Iterating global reduction 3 with 11 rules applied. Total rules applied 146 place count 143 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 154 place count 143 transition count 226
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 162 place count 135 transition count 201
Iterating global reduction 4 with 8 rules applied. Total rules applied 170 place count 135 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 174 place count 135 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 134 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 134 transition count 196
Applied a total of 176 rules in 21 ms. Remains 134 /209 variables (removed 75) and now considering 196/420 (removed 224) transitions.
// Phase 1: matrix 196 rows 134 cols
[2024-05-21 22:18:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:18:39] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 22:18:39] [INFO ] Invariant cache hit.
[2024-05-21 22:18:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 22:18:39] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 22:18:39] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-21 22:18:39] [INFO ] Invariant cache hit.
[2024-05-21 22:18:39] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/330 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 67/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 203 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/330 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 67/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 195/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 398 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19224ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19227ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/209 places, 196/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19609 ms. Remains : 134/209 places, 196/420 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-09 finished in 19877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 322
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 166 transition count 297
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 166 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 166 transition count 295
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 150 transition count 267
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 150 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 133 place count 150 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 145 place count 138 transition count 222
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 138 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 162 place count 138 transition count 217
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 171 place count 129 transition count 191
Iterating global reduction 4 with 9 rules applied. Total rules applied 180 place count 129 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 186 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 187 place count 128 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 128 transition count 184
Applied a total of 188 rules in 15 ms. Remains 128 /209 variables (removed 81) and now considering 184/420 (removed 236) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-21 22:18:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:18:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:18:58] [INFO ] Invariant cache hit.
[2024-05-21 22:18:58] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:18:59] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-21 22:18:59] [INFO ] Invariant cache hit.
[2024-05-21 22:18:59] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 22:19:00] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/312 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 22:19:03] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
[2024-05-21 22:19:03] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 195 constraints, problems are : Problem set: 0 solved, 183 unsolved in 8388 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 184/312 variables, 128/133 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 183/378 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 378 constraints, problems are : Problem set: 0 solved, 183 unsolved in 10984 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints]
After SMT, in 19588ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 19590ms
Starting structural reductions in LTL mode, iteration 1 : 128/209 places, 184/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19906 ms. Remains : 128/209 places, 184/420 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-10
Product exploration explored 100000 steps with 22920 reset in 161 ms.
Product exploration explored 100000 steps with 22938 reset in 147 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 465 edges and 128 vertex of which 127 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9209 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1810 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21043 steps, run visited all 1 properties in 32 ms. (steps per millisecond=657 )
Probabilistic random walk after 21043 steps, saw 10378 distinct states, run finished after 32 ms. (steps per millisecond=657 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 98 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-d2m08-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-10 finished in 20616 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((X(!p1)&&p0)))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 326
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 324
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 167 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 167 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 90 place count 167 transition count 297
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 151 transition count 269
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 151 transition count 269
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 133 place count 151 transition count 258
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 146 place count 138 transition count 222
Iterating global reduction 3 with 13 rules applied. Total rules applied 159 place count 138 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 165 place count 138 transition count 216
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 174 place count 129 transition count 190
Iterating global reduction 4 with 9 rules applied. Total rules applied 183 place count 129 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 128 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 128 transition count 184
Applied a total of 190 rules in 13 ms. Remains 128 /209 variables (removed 81) and now considering 184/420 (removed 236) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-21 22:19:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:19:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:19:19] [INFO ] Invariant cache hit.
[2024-05-21 22:19:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:19:19] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-21 22:19:19] [INFO ] Invariant cache hit.
[2024-05-21 22:19:19] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/312 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 191 constraints, problems are : Problem set: 0 solved, 183 unsolved in 4702 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/312 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 183/374 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 374 constraints, problems are : Problem set: 0 solved, 183 unsolved in 10524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
After SMT, in 15439ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 15441ms
Starting structural reductions in LTL mode, iteration 1 : 128/209 places, 184/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15767 ms. Remains : 128/209 places, 184/420 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-11 finished in 15854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1 U p2))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 186 transition count 321
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 169 transition count 299
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 169 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 169 transition count 296
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 99 place count 154 transition count 273
Iterating global reduction 2 with 15 rules applied. Total rules applied 114 place count 154 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 125 place count 154 transition count 262
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 144 transition count 236
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 144 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 place count 144 transition count 233
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 139 transition count 228
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 139 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 162 place count 139 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 138 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 138 transition count 223
Applied a total of 164 rules in 17 ms. Remains 138 /209 variables (removed 71) and now considering 223/420 (removed 197) transitions.
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 22:19:35] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:19:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 22:19:35] [INFO ] Invariant cache hit.
[2024-05-21 22:19:35] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 22:19:35] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-21 22:19:35] [INFO ] Invariant cache hit.
[2024-05-21 22:19:35] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 87/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 227 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 87/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 449 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 22160ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 22164ms
Starting structural reductions in LTL mode, iteration 1 : 138/209 places, 223/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22608 ms. Remains : 138/209 places, 223/420 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-12 finished in 22788 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(p0))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 185 transition count 328
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 167 transition count 305
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 167 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 167 transition count 302
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 151 transition count 275
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 151 transition count 275
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 135 place count 151 transition count 262
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 147 place count 139 transition count 227
Iterating global reduction 3 with 12 rules applied. Total rules applied 159 place count 139 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 167 place count 139 transition count 219
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 175 place count 131 transition count 194
Iterating global reduction 4 with 8 rules applied. Total rules applied 183 place count 131 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 130 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 130 transition count 188
Applied a total of 190 rules in 14 ms. Remains 130 /209 variables (removed 79) and now considering 188/420 (removed 232) transitions.
// Phase 1: matrix 188 rows 130 cols
[2024-05-21 22:19:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:19:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 22:19:58] [INFO ] Invariant cache hit.
[2024-05-21 22:19:58] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 22:19:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-21 22:19:58] [INFO ] Invariant cache hit.
[2024-05-21 22:19:58] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/318 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 196 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/318 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 187/383 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 383 constraints, problems are : Problem set: 0 solved, 187 unsolved in 14691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 20250ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 20252ms
Starting structural reductions in LTL mode, iteration 1 : 130/209 places, 188/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20557 ms. Remains : 130/209 places, 188/420 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Product exploration explored 100000 steps with 33333 reset in 207 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-13 finished in 21153 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 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 319
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 168 transition count 297
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 168 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 168 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 153 transition count 268
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 153 transition count 268
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 153 transition count 261
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 144 transition count 246
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 144 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 150 place count 144 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 158 place count 136 transition count 213
Iterating global reduction 4 with 8 rules applied. Total rules applied 166 place count 136 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 171 place count 136 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 135 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 135 transition count 207
Applied a total of 173 rules in 28 ms. Remains 135 /209 variables (removed 74) and now considering 207/420 (removed 213) transitions.
// Phase 1: matrix 207 rows 135 cols
[2024-05-21 22:20:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:20:19] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 22:20:19] [INFO ] Invariant cache hit.
[2024-05-21 22:20:19] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:20:19] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 22:20:19] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-21 22:20:19] [INFO ] Invariant cache hit.
[2024-05-21 22:20:19] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/342 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 22:20:23] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:20:23] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:20:23] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 221 constraints, problems are : Problem set: 0 solved, 206 unsolved in 8710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/342 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 81/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 206/427 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 427 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 3/3 constraints]
After SMT, in 24129ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 24132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/209 places, 207/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24518 ms. Remains : 135/209 places, 207/420 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-14
Product exploration explored 100000 steps with 22886 reset in 166 ms.
Product exploration explored 100000 steps with 22978 reset in 165 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 497 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 102 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9203 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1811 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1799 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1745 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1781 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1771 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1830 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1886578 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :5 out of 6
Probabilistic random walk after 1886578 steps, saw 774106 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :5
[2024-05-21 22:20:48] [INFO ] Invariant cache hit.
[2024-05-21 22:20:48] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/230 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 342/342 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 14/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 347 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p0 p1)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 207/207 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2024-05-21 22:20:48] [INFO ] Invariant cache hit.
[2024-05-21 22:20:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 22:20:48] [INFO ] Invariant cache hit.
[2024-05-21 22:20:48] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:20:49] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-21 22:20:49] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-21 22:20:49] [INFO ] Invariant cache hit.
[2024-05-21 22:20:49] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/342 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 22:20:52] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-05-21 22:20:52] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:20:53] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 221 constraints, problems are : Problem set: 0 solved, 206 unsolved in 8693 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/342 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 81/221 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 206/427 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 427 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 3/3 constraints]
After SMT, in 24488ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 24491ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24856 ms. Remains : 135/135 places, 207/207 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 497 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9119 resets) in 669 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1825 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1849 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1781 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1817 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1786 resets) in 232 ms. (171 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1788 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1750911 steps, run timeout after 3001 ms. (steps per millisecond=583 ) properties seen :5 out of 6
Probabilistic random walk after 1750911 steps, saw 715577 distinct states, run finished after 3002 ms. (steps per millisecond=583 ) properties seen :5
[2024-05-21 22:21:17] [INFO ] Invariant cache hit.
[2024-05-21 22:21:17] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/230 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 342/342 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 14/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 307 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 199 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 23011 reset in 177 ms.
Product exploration explored 100000 steps with 22970 reset in 175 ms.
Built C files in :
/tmp/ltsmin2380960106985002973
[2024-05-21 22:21:18] [INFO ] Computing symmetric may disable matrix : 207 transitions.
[2024-05-21 22:21:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:18] [INFO ] Computing symmetric may enable matrix : 207 transitions.
[2024-05-21 22:21:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:18] [INFO ] Computing Do-Not-Accords matrix : 207 transitions.
[2024-05-21 22:21:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:18] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2380960106985002973
Running compilation step : cd /tmp/ltsmin2380960106985002973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin2380960106985002973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2380960106985002973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5006301034162905462.hoa' '--buchi-type=spotba'
LTSmin run took 432 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-14 finished in 60585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 324
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 322
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 165 transition count 298
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 165 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 111 place count 148 transition count 265
Iterating global reduction 2 with 17 rules applied. Total rules applied 128 place count 148 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 139 place count 148 transition count 254
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 152 place count 135 transition count 218
Iterating global reduction 3 with 13 rules applied. Total rules applied 165 place count 135 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 171 place count 135 transition count 212
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 180 place count 126 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 189 place count 126 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 195 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 125 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 125 transition count 179
Applied a total of 197 rules in 20 ms. Remains 125 /209 variables (removed 84) and now considering 179/420 (removed 241) transitions.
// Phase 1: matrix 179 rows 125 cols
[2024-05-21 22:21:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:21:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:21:19] [INFO ] Invariant cache hit.
[2024-05-21 22:21:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 22:21:20] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-21 22:21:20] [INFO ] Redundant transitions in 0 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 22:21:20] [INFO ] Invariant cache hit.
[2024-05-21 22:21:20] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 17589ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 17591ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/209 places, 179/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17894 ms. Remains : 125/209 places, 179/420 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-15 finished in 17953 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(F(p1)))))'
[2024-05-21 22:21:37] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1995880186763442419
[2024-05-21 22:21:37] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2024-05-21 22:21:37] [INFO ] Applying decomposition
[2024-05-21 22:21:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:37] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2024-05-21 22:21:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:21:37] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:21:38] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2024-05-21 22:21:38] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6447762652283974087.txt' '-o' '/tmp/graph6447762652283974087.bin' '-w' '/tmp/graph6447762652283974087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6447762652283974087.bin' '-l' '-1' '-v' '-w' '/tmp/graph6447762652283974087.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:21:38] [INFO ] Decomposing Gal with order
[2024-05-21 22:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:21:38] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1995880186763442419
Running compilation step : cd /tmp/ltsmin1995880186763442419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 22:21:38] [INFO ] Removed a total of 407 redundant transitions.
[2024-05-21 22:21:38] [INFO ] Flatten gal took : 105 ms
[2024-05-21 22:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 14 ms.
[2024-05-21 22:21:38] [INFO ] Time to serialize gal into /tmp/LTLFireability15909785788378824859.gal : 20 ms
[2024-05-21 22:21:38] [INFO ] Time to serialize properties into /tmp/LTLFireability7385911852002363434.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15909785788378824859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7385911852002363434.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("((i6.u0.s1>=1)&&(i5.u19.l3846>=1))")||(G(F("((i6.u0.s1<1)||(u24.l4112<1))"))))))
Formula 0 simplified : G(!"((i6.u0.s1>=1)&&(i5.u19.l3846>=1))" & FG!"((i6.u0.s1<1)||(u24.l4112<1))")
Compilation finished in 1236 ms.
Running link step : cd /tmp/ltsmin1995880186763442419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1995880186763442419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:44:30] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:44:30] [INFO ] Time to serialize gal into /tmp/LTLFireability1208657487563317015.gal : 19 ms
[2024-05-21 22:44:30] [INFO ] Time to serialize properties into /tmp/LTLFireability9163720651366100329.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1208657487563317015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9163720651366100329.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(("((s1>=1)&&(l3846>=1))")||(G(F("((s1<1)||(l4112<1))"))))))
Formula 0 simplified : G(!"((s1>=1)&&(l3846>=1))" & FG!"((s1<1)||(l4112<1))")
Detected timeout of ITS tools.
[2024-05-21 23:07:22] [INFO ] Flatten gal took : 57 ms
[2024-05-21 23:07:22] [INFO ] Input system was already deterministic with 420 transitions.
[2024-05-21 23:07:22] [INFO ] Transformed 209 places.
[2024-05-21 23:07:22] [INFO ] Transformed 420 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 23:07:22] [INFO ] Time to serialize gal into /tmp/LTLFireability4795847834626337231.gal : 2 ms
[2024-05-21 23:07:22] [INFO ] Time to serialize properties into /tmp/LTLFireability12358327634025765204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4795847834626337231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12358327634025765204.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((s1>=1)&&(l3846>=1))")||(G(F("((s1<1)||(l4112<1))"))))))
Formula 0 simplified : G(!"((s1>=1)&&(l3846>=1))" & FG!"((s1<1)||(l4112<1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189600580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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