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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333272152

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-d2m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:14:33] [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 23:14:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:14:33] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-21 23:14:33] [INFO ] Transformed 4763 places.
[2024-05-21 23:14:33] [INFO ] Transformed 2478 transitions.
[2024-05-21 23:14:33] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 313 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 5 formulas.
Deduced a syphon composed of 3580 places in 26 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 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 377 places :
Symmetric choice reduction at 1 with 377 rule applications. Total rules 622 place count 760 transition count 1397
Iterating global reduction 1 with 377 rules applied. Total rules applied 999 place count 760 transition count 1397
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1044 place count 760 transition count 1352
Discarding 301 places :
Symmetric choice reduction at 2 with 301 rule applications. Total rules 1345 place count 459 transition count 1051
Iterating global reduction 2 with 301 rules applied. Total rules applied 1646 place count 459 transition count 1051
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1655 place count 459 transition count 1042
Discarding 226 places :
Symmetric choice reduction at 3 with 226 rule applications. Total rules 1881 place count 233 transition count 726
Iterating global reduction 3 with 226 rules applied. Total rules applied 2107 place count 233 transition count 726
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Iterating post reduction 3 with 259 rules applied. Total rules applied 2366 place count 233 transition count 467
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2383 place count 216 transition count 437
Iterating global reduction 4 with 17 rules applied. Total rules applied 2400 place count 216 transition count 437
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 2415 place count 216 transition count 422
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2425 place count 206 transition count 412
Iterating global reduction 5 with 10 rules applied. Total rules applied 2435 place count 206 transition count 412
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2438 place count 206 transition count 409
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2446 place count 198 transition count 401
Iterating global reduction 6 with 8 rules applied. Total rules applied 2454 place count 198 transition count 401
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2459 place count 198 transition count 396
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2461 place count 196 transition count 392
Iterating global reduction 7 with 2 rules applied. Total rules applied 2463 place count 196 transition count 392
Applied a total of 2463 rules in 188 ms. Remains 196 /1183 variables (removed 987) and now considering 392/2478 (removed 2086) transitions.
// Phase 1: matrix 392 rows 196 cols
[2024-05-21 23:14:34] [INFO ] Computed 2 invariants in 23 ms
[2024-05-21 23:14:34] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-21 23:14:34] [INFO ] Invariant cache hit.
[2024-05-21 23:14:34] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-05-21 23:14:34] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-21 23:14:35] [INFO ] Invariant cache hit.
[2024-05-21 23:14:35] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/588 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 208/406 constraints. Problems are: Problem set: 0 solved, 391 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 0/588 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 406 constraints, problems are : Problem set: 0 solved, 391 unsolved in 18844 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/588 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 208/406 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 391/797 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/588 variables, and 797 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 50063ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 50085ms
Starting structural reductions in LTL mode, iteration 1 : 196/1183 places, 392/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51255 ms. Remains : 196/1183 places, 392/2478 transitions.
Support contains 37 out of 196 places after structural reductions.
[2024-05-21 23:15:25] [INFO ] Flatten gal took : 85 ms
[2024-05-21 23:15:25] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:15:25] [INFO ] Input system was already deterministic with 392 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (9110 resets) in 4024 ms. (9 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4004 steps (394 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (361 resets) in 77 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (180 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (180 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (176 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (387 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (333 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (166 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (393 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (370 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (161 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (161 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (389 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (196 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (178 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (185 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (388 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (167 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (167 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (180 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (161 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (369 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (388 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (162 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
[2024-05-21 23:15:27] [INFO ] Invariant cache hit.
[2024-05-21 23:15:27] [INFO ] State equation strengthened by 208 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/95 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 44/139 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 289/428 variables, 139/141 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 105/246 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 160/588 variables, 57/303 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 103/406 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/588 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 406 constraints, problems are : Problem set: 1 solved, 23 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 65/94 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 45/139 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-05-21 23:15:29] [INFO ] Deduced a trap composed of 75 places in 355 ms of which 22 ms to minimize.
[2024-05-21 23:15:29] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 2 ms to minimize.
[2024-05-21 23:15:29] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:15:29] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 4 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 21 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:15:30] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:15:31] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:15:31] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:15:31] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 13/19 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 289/428 variables, 139/158 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 105/263 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 2/265 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-05-21 23:15:31] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:15:31] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:15:31] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:15:32] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 12/277 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 160/588 variables, 57/334 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 103/437 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/588 variables, and 458 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 23/24 constraints, Known Traps: 29/29 constraints]
After SMT, in 6622ms problems are : Problem set: 1 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 392/392 transitions.
Graph (complete) has 730 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 195 transition count 386
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 192 transition count 378
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 192 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 189 transition count 375
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 189 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 189 transition count 374
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 187 transition count 371
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 187 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 187 transition count 368
Applied a total of 27 rules in 92 ms. Remains 187 /196 variables (removed 9) and now considering 368/392 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 187/196 places, 368/392 transitions.
RANDOM walk for 40000 steps (9160 resets) in 683 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (395 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (399 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (168 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (183 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (182 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (372 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (372 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (390 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (382 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (174 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (202 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (332 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (175 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (188 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (180 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (381 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (163 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (175 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (170 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (176 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (372 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (374 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (165 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 112252 steps, run visited all 23 properties in 617 ms. (steps per millisecond=181 )
Probabilistic random walk after 112252 steps, saw 43502 distinct states, run finished after 620 ms. (steps per millisecond=181 ) properties seen :23
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 31 stable transitions
Graph (complete) has 790 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 313
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 309
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 285
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 160 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 149 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 149 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 149 transition count 258
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 140 transition count 242
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 140 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 131 place count 140 transition count 239
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 137 place count 134 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 143 place count 134 transition count 233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 152 place count 134 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 158 place count 128 transition count 191
Iterating global reduction 5 with 6 rules applied. Total rules applied 164 place count 128 transition count 191
Applied a total of 164 rules in 32 ms. Remains 128 /196 variables (removed 68) and now considering 191/392 (removed 201) transitions.
// Phase 1: matrix 191 rows 128 cols
[2024-05-21 23:15:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:15:35] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 23:15:35] [INFO ] Invariant cache hit.
[2024-05-21 23:15:35] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 23:15:35] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-21 23:15:35] [INFO ] Redundant transitions in 7 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-21 23:15:35] [INFO ] Invariant cache hit.
[2024-05-21 23:15:35] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 70/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 200 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 70/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 190/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 390 constraints, problems are : Problem set: 0 solved, 190 unsolved in 14042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 19621ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 19623ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/196 places, 191/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20088 ms. Remains : 128/196 places, 191/392 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00
Product exploration explored 100000 steps with 22925 reset in 307 ms.
Product exploration explored 100000 steps with 22972 reset in 210 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 469 edges and 128 vertex of which 127 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9200 resets) in 413 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3834 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3767 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3830 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3870 resets) in 316 ms. (126 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 20841 steps, run visited all 4 properties in 159 ms. (steps per millisecond=131 )
Probabilistic random walk after 20841 steps, saw 10331 distinct states, run finished after 159 ms. (steps per millisecond=131 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 191/191 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 23:15:57] [INFO ] Invariant cache hit.
[2024-05-21 23:15:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:15:57] [INFO ] Invariant cache hit.
[2024-05-21 23:15:57] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 23:15:58] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-21 23:15:58] [INFO ] Redundant transitions in 5 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-21 23:15:58] [INFO ] Invariant cache hit.
[2024-05-21 23:15:58] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 70/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 200 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 70/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 190/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 390 constraints, problems are : Problem set: 0 solved, 190 unsolved in 14115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 19660ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 19662ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20121 ms. Remains : 128/128 places, 191/191 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 469 edges and 128 vertex of which 127 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 (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9141 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3795 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3847 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3800 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3907 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 20841 steps, run visited all 4 properties in 67 ms. (steps per millisecond=311 )
Probabilistic random walk after 20841 steps, saw 10331 distinct states, run finished after 68 ms. (steps per millisecond=306 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23012 reset in 140 ms.
Product exploration explored 100000 steps with 22997 reset in 130 ms.
Built C files in :
/tmp/ltsmin18432074905915337018
[2024-05-21 23:16:19] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-21 23:16:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:19] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-21 23:16:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:19] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-21 23:16:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:19] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18432074905915337018
Running compilation step : cd /tmp/ltsmin18432074905915337018;'/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 660 ms.
Running link step : cd /tmp/ltsmin18432074905915337018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin18432074905915337018;'/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/stateBased12223678175176843618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-21 23:16:34] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 70/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 200 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 70/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 190/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 390 constraints, problems are : Problem set: 0 solved, 190 unsolved in 14078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 19455ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 19458ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20037 ms. Remains : 128/128 places, 191/191 transitions.
Built C files in :
/tmp/ltsmin6647511749179095825
[2024-05-21 23:16:54] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-21 23:16:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:54] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-21 23:16:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:54] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-21 23:16:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6647511749179095825
Running compilation step : cd /tmp/ltsmin6647511749179095825;'/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 435 ms.
Running link step : cd /tmp/ltsmin6647511749179095825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6647511749179095825;'/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/stateBased13031091316613966997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:17:09] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:17:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:17:09] [INFO ] Time to serialize gal into /tmp/LTL14381883310349381026.gal : 25 ms
[2024-05-21 23:17:09] [INFO ] Time to serialize properties into /tmp/LTL751048844438682811.prop : 15 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/LTL14381883310349381026.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4712457406824772115.hoa' '-atoms' '/tmp/LTL751048844438682811.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...317
Loading property file /tmp/LTL751048844438682811.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4712457406824772115.hoa
Detected timeout of ITS tools.
[2024-05-21 23:17:24] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:17:24] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:17:24] [INFO ] Time to serialize gal into /tmp/LTL13969967184517255827.gal : 6 ms
[2024-05-21 23:17:24] [INFO ] Time to serialize properties into /tmp/LTL2713332806623881910.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/LTL13969967184517255827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2713332806623881910.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 : !((G(F((!("((p213>=1)&&(l0>=1))"))U((G(!("((p213>=1)&&(l0>=1))")))||("((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))"))))))
Formula 0 simplified : FG("((p213>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")
Detected timeout of ITS tools.
[2024-05-21 23:17:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:17:39] [INFO ] Applying decomposition
[2024-05-21 23:17:39] [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/graph4924631676050701638.txt' '-o' '/tmp/graph4924631676050701638.bin' '-w' '/tmp/graph4924631676050701638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4924631676050701638.bin' '-l' '-1' '-v' '-w' '/tmp/graph4924631676050701638.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:17:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:17:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:17:39] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-21 23:17:40] [INFO ] Flatten gal took : 175 ms
[2024-05-21 23:17:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 34 ms.
[2024-05-21 23:17:40] [INFO ] Time to serialize gal into /tmp/LTL10979193866145023474.gal : 16 ms
[2024-05-21 23:17:40] [INFO ] Time to serialize properties into /tmp/LTL1131666100466445606.ltl : 10 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/LTL10979193866145023474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1131666100466445606.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i2.u8.p213>=1)&&(i5.u1.l0>=1))"))U((G(!("((i2.u8.p213>=1)&&(i5.u1.l0>=1))")))||("((!((i5.u1.s1>=1)&&(i2.u8.l3083>=1)))&&(...197
Formula 0 simplified : FG("((i2.u8.p213>=1)&&(i5.u1.l0>=1))" M !"((!((i5.u1.s1>=1)&&(i2.u8.l3083>=1)))&&(!((i2.u8.p213>=1)&&(i5.u1.l0>=1))))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 139797 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((G(F(p1))||p0))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 178 transition count 325
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 178 transition count 325
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 178 transition count 321
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 163 transition count 298
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 163 transition count 298
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 163 transition count 293
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 153 transition count 279
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 153 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 100 place count 153 transition count 274
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 146 transition count 262
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 146 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 146 transition count 261
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 121 place count 140 transition count 255
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 140 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 136 place count 140 transition count 246
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 143 place count 133 transition count 205
Iterating global reduction 5 with 7 rules applied. Total rules applied 150 place count 133 transition count 205
Applied a total of 150 rules in 38 ms. Remains 133 /196 variables (removed 63) and now considering 205/392 (removed 187) transitions.
// Phase 1: matrix 205 rows 133 cols
[2024-05-21 23:17:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:17:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 23:17:55] [INFO ] Invariant cache hit.
[2024-05-21 23:17:55] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 23:17:55] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-21 23:17:55] [INFO ] Redundant transitions in 2 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-21 23:17:55] [INFO ] Invariant cache hit.
[2024-05-21 23:17:55] [INFO ] State equation strengthened by 80 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, 80/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 215 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 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, 80/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 204/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 419 constraints, problems are : Problem set: 0 solved, 204 unsolved in 14339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 20412ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 20414ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/196 places, 205/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20922 ms. Remains : 133/196 places, 205/392 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-01
Product exploration explored 100000 steps with 23032 reset in 147 ms.
Product exploration explored 100000 steps with 23043 reset in 153 ms.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 493 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9223 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1765 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1834 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1799 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21122 steps, run visited all 3 properties in 129 ms. (steps per millisecond=163 )
Probabilistic random walk after 21122 steps, saw 10442 distinct states, run finished after 130 ms. (steps per millisecond=162 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 188 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 77 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))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 205/205 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-21 23:18:17] [INFO ] Invariant cache hit.
[2024-05-21 23:18:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:18:17] [INFO ] Invariant cache hit.
[2024-05-21 23:18:17] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 23:18:17] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-21 23:18:17] [INFO ] Redundant transitions in 2 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-21 23:18:17] [INFO ] Invariant cache hit.
[2024-05-21 23:18:17] [INFO ] State equation strengthened by 80 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, 80/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 215 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 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, 80/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 204/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 419 constraints, problems are : Problem set: 0 solved, 204 unsolved in 14699 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 20669ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 20672ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21052 ms. Remains : 133/133 places, 205/205 transitions.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 493 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 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9250 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1792 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1789 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1765 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21122 steps, run visited all 3 properties in 116 ms. (steps per millisecond=182 )
Probabilistic random walk after 21122 steps, saw 10442 distinct states, run finished after 116 ms. (steps per millisecond=182 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 130 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23057 reset in 160 ms.
Product exploration explored 100000 steps with 23139 reset in 163 ms.
Built C files in :
/tmp/ltsmin15626808591400850125
[2024-05-21 23:18:39] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-21 23:18:39] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:39] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-21 23:18:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:39] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-21 23:18:39] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:39] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15626808591400850125
Running compilation step : cd /tmp/ltsmin15626808591400850125;'/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 496 ms.
Running link step : cd /tmp/ltsmin15626808591400850125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15626808591400850125;'/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/stateBased6127679602403096180.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 205/205 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-21 23:18:54] [INFO ] Invariant cache hit.
[2024-05-21 23:18:54] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 23:18:54] [INFO ] Invariant cache hit.
[2024-05-21 23:18:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 23:18:54] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 23:18:54] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-21 23:18:54] [INFO ] Invariant cache hit.
[2024-05-21 23:18:54] [INFO ] State equation strengthened by 80 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, 80/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 215 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 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, 80/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 204/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 419 constraints, problems are : Problem set: 0 solved, 204 unsolved in 14649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 20651ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 20654ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21030 ms. Remains : 133/133 places, 205/205 transitions.
Built C files in :
/tmp/ltsmin364734999350207023
[2024-05-21 23:19:15] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-21 23:19:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:15] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-21 23:19:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:15] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-21 23:19:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:15] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin364734999350207023
Running compilation step : cd /tmp/ltsmin364734999350207023;'/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 487 ms.
Running link step : cd /tmp/ltsmin364734999350207023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin364734999350207023;'/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/stateBased2811235115325860298.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:19:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:19:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:19:30] [INFO ] Time to serialize gal into /tmp/LTL11805091577039283764.gal : 2 ms
[2024-05-21 23:19:30] [INFO ] Time to serialize properties into /tmp/LTL1119673379441756775.prop : 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/LTL11805091577039283764.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16116839589639267388.hoa' '-atoms' '/tmp/LTL1119673379441756775.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...319
Loading property file /tmp/LTL1119673379441756775.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16116839589639267388.hoa
Detected timeout of ITS tools.
[2024-05-21 23:19:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:19:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:19:45] [INFO ] Time to serialize gal into /tmp/LTL11570429511117267646.gal : 1 ms
[2024-05-21 23:19:45] [INFO ] Time to serialize properties into /tmp/LTL3755911623080757010.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/LTL11570429511117267646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3755911623080757010.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 : !((G(F(((G(F("((s1>=1)&&(l3847>=1))")))||("((s1>=1)&&(l3828>=1))"))||("(((s1<1)||(l3086<1))&&((s1<1)||(l3828<1)))")))))
Formula 0 simplified : FG(!"(((s1<1)||(l3086<1))&&((s1<1)||(l3828<1)))" & !"((s1>=1)&&(l3828>=1))" & !"((s1>=1)&&(l3847>=1))")
Detected timeout of ITS tools.
[2024-05-21 23:20:00] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:20:00] [INFO ] Applying decomposition
[2024-05-21 23:20:00] [INFO ] Flatten gal took : 8 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/graph12254909925915952749.txt' '-o' '/tmp/graph12254909925915952749.bin' '-w' '/tmp/graph12254909925915952749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12254909925915952749.bin' '-l' '-1' '-v' '-w' '/tmp/graph12254909925915952749.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:20:00] [INFO ] Decomposing Gal with order
[2024-05-21 23:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:20:00] [INFO ] Removed a total of 223 redundant transitions.
[2024-05-21 23:20:01] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 6 ms.
[2024-05-21 23:20:01] [INFO ] Time to serialize gal into /tmp/LTL13938366730913755436.gal : 2 ms
[2024-05-21 23:20:01] [INFO ] Time to serialize properties into /tmp/LTL5687520844954779833.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/LTL13938366730913755436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5687520844954779833.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((G(F("((i5.u0.s1>=1)&&(u17.l3847>=1))")))||("((i5.u0.s1>=1)&&(u17.l3828>=1))"))||("(((i5.u0.s1<1)||(i5.u5.l3086<1))&&((i5.u0.s...182
Formula 0 simplified : FG(!"(((i5.u0.s1<1)||(i5.u5.l3086<1))&&((i5.u0.s1<1)||(u17.l3828<1)))" & !"((i5.u0.s1>=1)&&(u17.l3828>=1))" & !"((i5.u0.s1>=1)&&(u17...168
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-01 finished in 140866 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(((!p1 U (p2||G(!p1)))&&p0)))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 310
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 162 transition count 283
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 162 transition count 283
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 162 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 151 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 151 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 104 place count 151 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 143 transition count 244
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 143 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 143 transition count 242
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 128 place count 137 transition count 236
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 137 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 142 place count 137 transition count 228
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 131 transition count 192
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 131 transition count 192
Applied a total of 154 rules in 9 ms. Remains 131 /196 variables (removed 65) and now considering 192/392 (removed 200) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-21 23:20:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 23:20:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 23:20:16] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 23:20:16] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-21 23:20:16] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] State equation strengthened by 68 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, 68/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-21 23:20:22] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:20:22] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/323 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 0/323 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 203 constraints, problems are : Problem set: 0 solved, 191 unsolved in 10539 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 192/323 variables, 131/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 191/394 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 394 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 2/2 constraints]
After SMT, in 22464ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 22466ms
Starting structural reductions in LTL mode, iteration 1 : 131/196 places, 192/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22820 ms. Remains : 131/196 places, 192/392 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-04 finished in 23037 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((X(X(p0)) U p1))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 299
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 278
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 278
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 160 transition count 271
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 149 transition count 256
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 149 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 149 transition count 251
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 141 transition count 236
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 141 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 129 place count 141 transition count 233
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 134 place count 136 transition count 228
Iterating global reduction 4 with 5 rules applied. Total rules applied 139 place count 136 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 144 place count 136 transition count 223
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 148 place count 132 transition count 202
Iterating global reduction 5 with 4 rules applied. Total rules applied 152 place count 132 transition count 202
Applied a total of 152 rules in 12 ms. Remains 132 /196 variables (removed 64) and now considering 202/392 (removed 190) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-21 23:20:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:20:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 23:20:39] [INFO ] Invariant cache hit.
[2024-05-21 23:20:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-21 23:20:39] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 23:20:39] [INFO ] Invariant cache hit.
[2024-05-21 23:20:39] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 76/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 210 constraints, problems are : Problem set: 0 solved, 201 unsolved in 6027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 76/210 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 201/411 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 411 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22966ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22968ms
Starting structural reductions in LTL mode, iteration 1 : 132/196 places, 202/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23686 ms. Remains : 132/196 places, 202/392 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-05 finished in 24214 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)) U (F(p1)&&(p2 U p3))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 315
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 163 transition count 289
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 163 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 163 transition count 283
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 153 transition count 270
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 153 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 153 transition count 266
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 146 transition count 253
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 146 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 146 transition count 249
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 123 place count 141 transition count 244
Iterating global reduction 4 with 5 rules applied. Total rules applied 128 place count 141 transition count 244
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 135 place count 141 transition count 237
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 142 place count 134 transition count 196
Iterating global reduction 5 with 7 rules applied. Total rules applied 149 place count 134 transition count 196
Applied a total of 149 rules in 41 ms. Remains 134 /196 variables (removed 62) and now considering 196/392 (removed 196) transitions.
// Phase 1: matrix 196 rows 134 cols
[2024-05-21 23:21:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:21:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 23:21:03] [INFO ] Invariant cache hit.
[2024-05-21 23:21:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 23:21:03] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-05-21 23:21:03] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-21 23:21:03] [INFO ] Invariant cache hit.
[2024-05-21 23:21:03] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/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, 68/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 11 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 5 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 215 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 196/330 variables, 134/147 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 68/215 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 195/410 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 410 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints]
After SMT, in 21132ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 21133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/196 places, 196/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21663 ms. Remains : 134/196 places, 196/392 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p3) (NOT p1)), (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-06 finished in 21880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(F(p0))||G(F(G(X(G(p1)))))) U p2))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 315
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 163 transition count 289
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 163 transition count 289
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 163 transition count 284
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 153 transition count 271
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 153 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 99 place count 153 transition count 267
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 106 place count 146 transition count 254
Iterating global reduction 3 with 7 rules applied. Total rules applied 113 place count 146 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 146 transition count 250
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 122 place count 141 transition count 245
Iterating global reduction 4 with 5 rules applied. Total rules applied 127 place count 141 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 134 place count 141 transition count 238
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 141 place count 134 transition count 197
Iterating global reduction 5 with 7 rules applied. Total rules applied 148 place count 134 transition count 197
Applied a total of 148 rules in 14 ms. Remains 134 /196 variables (removed 62) and now considering 197/392 (removed 195) transitions.
// Phase 1: matrix 197 rows 134 cols
[2024-05-21 23:21:25] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 23:21:25] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 23:21:25] [INFO ] Invariant cache hit.
[2024-05-21 23:21:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 23:21:25] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-21 23:21:25] [INFO ] Invariant cache hit.
[2024-05-21 23:21:25] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/331 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 68/204 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 204 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/331 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 68/204 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 196/400 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 400 constraints, problems are : Problem set: 0 solved, 196 unsolved in 14386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 19836ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 19839ms
Starting structural reductions in LTL mode, iteration 1 : 134/196 places, 197/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20165 ms. Remains : 134/196 places, 197/392 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-07 finished in 20359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 178 transition count 315
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 178 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 178 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 164 transition count 289
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 164 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 74 place count 164 transition count 283
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 154 transition count 271
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 154 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 154 transition count 267
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 105 place count 147 transition count 253
Iterating global reduction 3 with 7 rules applied. Total rules applied 112 place count 147 transition count 253
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 121 place count 147 transition count 244
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 143 transition count 240
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 143 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 136 place count 143 transition count 233
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 143 place count 136 transition count 192
Iterating global reduction 5 with 7 rules applied. Total rules applied 150 place count 136 transition count 192
Applied a total of 150 rules in 12 ms. Remains 136 /196 variables (removed 60) and now considering 192/392 (removed 200) transitions.
// Phase 1: matrix 192 rows 136 cols
[2024-05-21 23:21:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:21:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 23:21:45] [INFO ] Invariant cache hit.
[2024-05-21 23:21:45] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 23:21:45] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-21 23:21:45] [INFO ] Invariant cache hit.
[2024-05-21 23:21:45] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/328 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 200 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 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/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/328 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 191/391 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 391 constraints, problems are : Problem set: 0 solved, 191 unsolved in 11163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17577ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17579ms
Starting structural reductions in LTL mode, iteration 1 : 136/196 places, 192/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17912 ms. Remains : 136/196 places, 192/392 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 490 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-10 finished in 18468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F((p1&&F(p2))))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 304
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 304
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 300
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 162 transition count 278
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 162 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 162 transition count 272
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 151 transition count 257
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 151 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 151 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 113 place count 142 transition count 237
Iterating global reduction 3 with 9 rules applied. Total rules applied 122 place count 142 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 142 transition count 234
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 131 place count 136 transition count 228
Iterating global reduction 4 with 6 rules applied. Total rules applied 137 place count 136 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 145 place count 136 transition count 220
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 149 place count 132 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 153 place count 132 transition count 199
Applied a total of 153 rules in 8 ms. Remains 132 /196 variables (removed 64) and now considering 199/392 (removed 193) transitions.
// Phase 1: matrix 199 rows 132 cols
[2024-05-21 23:22:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 23:22:04] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:22:04] [INFO ] Invariant cache hit.
[2024-05-21 23:22:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 23:22:04] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 23:22:04] [INFO ] Invariant cache hit.
[2024-05-21 23:22:04] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 75/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 23:22:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 210 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7395 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/331 variables, 132/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 75/210 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 198/408 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/331 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 408 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints]
After SMT, in 19308ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 19314ms
Starting structural reductions in LTL mode, iteration 1 : 132/196 places, 199/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19687 ms. Remains : 132/196 places, 199/392 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 484 edges and 132 vertex of which 131 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 p2 p0 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-11 finished in 20312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&F((F(p3)&&p2))))||p0)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 178 transition count 306
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 178 transition count 306
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 162 transition count 285
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 162 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 162 transition count 278
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 151 transition count 263
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 151 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 102 place count 151 transition count 258
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 143 transition count 243
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 143 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 143 transition count 240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 138 transition count 235
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 138 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 138 transition count 230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 137 transition count 229
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 137 transition count 229
Applied a total of 138 rules in 8 ms. Remains 137 /196 variables (removed 59) and now considering 229/392 (removed 163) transitions.
// Phase 1: matrix 229 rows 137 cols
[2024-05-21 23:22:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:22:24] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:22:24] [INFO ] Invariant cache hit.
[2024-05-21 23:22:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 23:22:24] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 23:22:24] [INFO ] Invariant cache hit.
[2024-05-21 23:22:24] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/366 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 100/239 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 239 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/366 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 100/239 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 228/467 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 467 constraints, problems are : Problem set: 0 solved, 228 unsolved in 18994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 26909ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 26913ms
Starting structural reductions in LTL mode, iteration 1 : 137/196 places, 229/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27340 ms. Remains : 137/196 places, 229/392 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 517 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 154 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-d2m10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-12 finished in 28159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 299
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 276
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 160 transition count 270
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 148 transition count 254
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 148 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 148 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 140 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 140 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 135 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 135 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 147 place count 135 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 154 place count 128 transition count 178
Iterating global reduction 5 with 7 rules applied. Total rules applied 161 place count 128 transition count 178
Applied a total of 161 rules in 14 ms. Remains 128 /196 variables (removed 68) and now considering 178/392 (removed 214) transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-21 23:22:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 23:22:52] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 23:22:52] [INFO ] Invariant cache hit.
[2024-05-21 23:22:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 23:22:52] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:22:52] [INFO ] Invariant cache hit.
[2024-05-21 23:22:52] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14600ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14614ms
Starting structural reductions in LTL mode, iteration 1 : 128/196 places, 178/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15071 ms. Remains : 128/196 places, 178/392 transitions.
Stuttering acceptance computed with spot in 162 ms :[p0, p0, false, false, false]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13
Product exploration explored 100000 steps with 37375 reset in 142 ms.
Product exploration explored 100000 steps with 37270 reset in 144 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[p0, p0, false, false, false]
RANDOM walk for 40000 steps (9265 resets) in 364 ms. (109 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1796 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3948 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3874 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
[2024-05-21 23:23:08] [INFO ] Invariant cache hit.
[2024-05-21 23:23:08] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 1 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 186 constraints, problems are : Problem set: 1 solved, 2 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 642ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 6 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9172 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3721 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3851 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21097 steps, run visited all 2 properties in 122 ms. (steps per millisecond=172 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 124 ms. (steps per millisecond=170 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 203 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 23:23:10] [INFO ] Invariant cache hit.
[2024-05-21 23:23:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 23:23:10] [INFO ] Invariant cache hit.
[2024-05-21 23:23:10] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 23:23:10] [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.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:23:10] [INFO ] Invariant cache hit.
[2024-05-21 23:23:10] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9627 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14355ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14358ms
Finished structural reductions in LTL mode , in 1 iterations and 14668 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9165 resets) in 224 ms. (177 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3824 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-21 23:23:25] [INFO ] Invariant cache hit.
[2024-05-21 23:23:25] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 15 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9124 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3850 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 40 ms. (steps per millisecond=527 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 40 ms. (steps per millisecond=527 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 193 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 184 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37289 reset in 139 ms.
Product exploration explored 100000 steps with 37299 reset in 146 ms.
Built C files in :
/tmp/ltsmin16526204969259003881
[2024-05-21 23:23:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16526204969259003881
Running compilation step : cd /tmp/ltsmin16526204969259003881;'/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 314 ms.
Running link step : cd /tmp/ltsmin16526204969259003881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16526204969259003881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6901069123733286565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 23:23:42] [INFO ] Invariant cache hit.
[2024-05-21 23:23:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 23:23:42] [INFO ] Invariant cache hit.
[2024-05-21 23:23:42] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 23:23:42] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:23:42] [INFO ] Invariant cache hit.
[2024-05-21 23:23:42] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4481 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14117ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14118ms
Finished structural reductions in LTL mode , in 1 iterations and 14444 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin2497928146733964403
[2024-05-21 23:23:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2497928146733964403
Running compilation step : cd /tmp/ltsmin2497928146733964403;'/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 323 ms.
Running link step : cd /tmp/ltsmin2497928146733964403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2497928146733964403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5483875472567185977.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:24:11] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:24:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:24:11] [INFO ] Time to serialize gal into /tmp/LTL13711440840806061312.gal : 2 ms
[2024-05-21 23:24:11] [INFO ] Time to serialize properties into /tmp/LTL11292502871749304484.prop : 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/LTL13711440840806061312.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4493119484552767546.hoa' '-atoms' '/tmp/LTL11292502871749304484.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...319
Loading property file /tmp/LTL11292502871749304484.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4493119484552767546.hoa
Detected timeout of ITS tools.
[2024-05-21 23:24:26] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:24:26] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:26] [INFO ] Time to serialize gal into /tmp/LTL4982230990073501827.gal : 4 ms
[2024-05-21 23:24:26] [INFO ] Time to serialize properties into /tmp/LTL5040668746502060604.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/LTL4982230990073501827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5040668746502060604.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2024-05-21 23:24:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:42] [INFO ] Applying decomposition
[2024-05-21 23:24:42] [INFO ] Flatten gal took : 7 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/graph10488724560068857738.txt' '-o' '/tmp/graph10488724560068857738.bin' '-w' '/tmp/graph10488724560068857738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10488724560068857738.bin' '-l' '-1' '-v' '-w' '/tmp/graph10488724560068857738.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:24:42] [INFO ] Decomposing Gal with order
[2024-05-21 23:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:24:42] [INFO ] Removed a total of 214 redundant transitions.
[2024-05-21 23:24:42] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 6 ms.
[2024-05-21 23:24:42] [INFO ] Time to serialize gal into /tmp/LTL12515525789835935876.gal : 2 ms
[2024-05-21 23:24:42] [INFO ] Time to serialize properties into /tmp/LTL8703620366041749176.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/LTL12515525789835935876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8703620366041749176.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i0.u0.s1>=1)&&(i6.u15.l3659>=1))"))U((X(("((i0.u0.s1>=1)&&(i6.u15.l3659>=1))")||(G(!("((i6.u15.p362>=1)&&(i0.u0.l2273>...256
Formula 0 simplified : FG(!"((i0.u0.s1<1)||(i6.u15.l3659<1))" | X("((i0.u0.s1>=1)&&(i6.u15.l3659>=1))" M X(!"((i0.u0.s1>=1)&&(i6.u15.l3659>=1))" & F"((i6.u...189
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 124626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 309
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 305
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 281
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 160 transition count 274
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 149 transition count 259
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 149 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 149 transition count 254
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 117 place count 142 transition count 244
Iterating global reduction 3 with 7 rules applied. Total rules applied 124 place count 142 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 142 transition count 241
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 138 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 138 transition count 237
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 142 place count 138 transition count 230
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 132 transition count 190
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 132 transition count 190
Applied a total of 154 rules in 21 ms. Remains 132 /196 variables (removed 64) and now considering 190/392 (removed 202) transitions.
// Phase 1: matrix 190 rows 132 cols
[2024-05-21 23:24:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:24:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:24:57] [INFO ] Invariant cache hit.
[2024-05-21 23:24:57] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 23:24:57] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-21 23:24:57] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-21 23:24:57] [INFO ] Invariant cache hit.
[2024-05-21 23:24:57] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 385 constraints, problems are : Problem set: 0 solved, 189 unsolved in 14221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 19430ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 19432ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/196 places, 190/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19791 ms. Remains : 132/196 places, 190/392 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-14
Product exploration explored 100000 steps with 23148 reset in 122 ms.
Product exploration explored 100000 steps with 22998 reset in 129 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 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))]
RANDOM walk for 40000 steps (9158 resets) in 152 ms. (261 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (1755 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1817 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
[2024-05-21 23:25:17] [INFO ] Invariant cache hit.
[2024-05-21 23:25:17] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/322 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/322 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 190/190 transitions.
Graph (complete) has 448 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 187
Applied a total of 4 rules in 10 ms. Remains 131 /132 variables (removed 1) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 131/132 places, 187/190 transitions.
RANDOM walk for 40000 steps (9225 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1804 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1761 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 13 ms. (steps per millisecond=130 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 13 ms. (steps per millisecond=130 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 146 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 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 23:25:18] [INFO ] Invariant cache hit.
[2024-05-21 23:25:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 23:25:18] [INFO ] Invariant cache hit.
[2024-05-21 23:25:18] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 23:25:19] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-21 23:25:19] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-21 23:25:19] [INFO ] Invariant cache hit.
[2024-05-21 23:25:19] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 385 constraints, problems are : Problem set: 0 solved, 189 unsolved in 14077 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 19397ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 19400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19732 ms. Remains : 132/132 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9184 resets) in 288 ms. (138 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (1845 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1778 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
[2024-05-21 23:25:38] [INFO ] Invariant cache hit.
[2024-05-21 23:25:38] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/322 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/322 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 297 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 190/190 transitions.
Graph (complete) has 448 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 187
Applied a total of 4 rules in 5 ms. Remains 131 /132 variables (removed 1) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 131/132 places, 187/190 transitions.
RANDOM walk for 40000 steps (9202 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1758 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1745 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 33 ms. (steps per millisecond=51 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 33 ms. (steps per millisecond=51 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 190 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22982 reset in 141 ms.
Product exploration explored 100000 steps with 23020 reset in 142 ms.
Built C files in :
/tmp/ltsmin2345300879576327296
[2024-05-21 23:25:40] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-21 23:25:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:40] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-21 23:25:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:40] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-21 23:25:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:40] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2345300879576327296
Running compilation step : cd /tmp/ltsmin2345300879576327296;'/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 460 ms.
Running link step : cd /tmp/ltsmin2345300879576327296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2345300879576327296;'/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/stateBased14906245454583225443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 23:25:55] [INFO ] Invariant cache hit.
[2024-05-21 23:25:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:25:55] [INFO ] Invariant cache hit.
[2024-05-21 23:25:55] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 23:25:56] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-21 23:25:56] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-21 23:25:56] [INFO ] Invariant cache hit.
[2024-05-21 23:25:56] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 385 constraints, problems are : Problem set: 0 solved, 189 unsolved in 13854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 19143ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 19146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19498 ms. Remains : 132/132 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin17291057790995911601
[2024-05-21 23:26:15] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-21 23:26:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:26:15] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-21 23:26:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:26:15] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-21 23:26:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:26:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17291057790995911601
Running compilation step : cd /tmp/ltsmin17291057790995911601;'/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 434 ms.
Running link step : cd /tmp/ltsmin17291057790995911601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17291057790995911601;'/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/stateBased16400858933406408079.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:26:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:26:30] [INFO ] Time to serialize gal into /tmp/LTL778633082912633957.gal : 2 ms
[2024-05-21 23:26:30] [INFO ] Time to serialize properties into /tmp/LTL16569890089575376517.prop : 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/LTL778633082912633957.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5128815673992312583.hoa' '-atoms' '/tmp/LTL16569890089575376517.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...317
Loading property file /tmp/LTL16569890089575376517.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5128815673992312583.hoa
Detected timeout of ITS tools.
[2024-05-21 23:26:45] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:26:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:26:45] [INFO ] Time to serialize gal into /tmp/LTL10451223836331952764.gal : 1 ms
[2024-05-21 23:26:45] [INFO ] Time to serialize properties into /tmp/LTL3462150984393991569.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/LTL10451223836331952764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3462150984393991569.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 : !((G((F("((s1<1)||(l4129<1))"))||(X(F("((s1>=1)&&(l3657>=1))"))))))
Formula 0 simplified : F(G!"((s1<1)||(l4129<1))" & XG!"((s1>=1)&&(l3657>=1))")
Detected timeout of ITS tools.
[2024-05-21 23:27:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:27:00] [INFO ] Applying decomposition
[2024-05-21 23:27:00] [INFO ] Flatten gal took : 5 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/graph11157910806714539588.txt' '-o' '/tmp/graph11157910806714539588.bin' '-w' '/tmp/graph11157910806714539588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11157910806714539588.bin' '-l' '-1' '-v' '-w' '/tmp/graph11157910806714539588.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:00] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:00] [INFO ] Removed a total of 235 redundant transitions.
[2024-05-21 23:27:00] [INFO ] Flatten gal took : 46 ms
[2024-05-21 23:27:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 5 ms.
[2024-05-21 23:27:00] [INFO ] Time to serialize gal into /tmp/LTL10952458139450743909.gal : 11 ms
[2024-05-21 23:27:00] [INFO ] Time to serialize properties into /tmp/LTL15048788276531223563.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/LTL10952458139450743909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15048788276531223563.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...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.u0.s1<1)||(i2.u21.l4129<1))"))||(X(F("((i0.u0.s1>=1)&&(i6.u17.l3657>=1))"))))))
Formula 0 simplified : F(G!"((i0.u0.s1<1)||(i2.u21.l4129<1))" & XG!"((i0.u0.s1>=1)&&(i6.u17.l3657>=1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-14 finished in 138592 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 (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-13
Stuttering acceptance computed with spot in 162 ms :[p0, p0, false, false, false]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 196/196 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 176 transition count 299
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 160 transition count 276
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 160 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 160 transition count 270
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 148 transition count 254
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 148 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 148 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 140 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 140 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 135 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 135 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 147 place count 135 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 154 place count 128 transition count 178
Iterating global reduction 5 with 7 rules applied. Total rules applied 161 place count 128 transition count 178
Applied a total of 161 rules in 38 ms. Remains 128 /196 variables (removed 68) and now considering 178/392 (removed 214) transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-21 23:27:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 23:27:16] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-21 23:27:16] [INFO ] Invariant cache hit.
[2024-05-21 23:27:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 23:27:17] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:27:17] [INFO ] Invariant cache hit.
[2024-05-21 23:27:17] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4401 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14191ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14193ms
Starting structural reductions in LI_LTL mode, iteration 1 : 128/196 places, 178/392 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15047 ms. Remains : 128/196 places, 178/392 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13
Product exploration explored 100000 steps with 37341 reset in 136 ms.
Product exploration explored 100000 steps with 37469 reset in 151 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 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 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p0, p0, false, false, false]
RANDOM walk for 40000 steps (9216 resets) in 201 ms. (198 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3892 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3826 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
[2024-05-21 23:27:32] [INFO ] Invariant cache hit.
[2024-05-21 23:27:32] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 1 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 186 constraints, problems are : Problem set: 1 solved, 2 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 6 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9194 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3762 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3824 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21097 steps, run visited all 2 properties in 137 ms. (steps per millisecond=153 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 138 ms. (steps per millisecond=152 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 157 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 23:27:33] [INFO ] Invariant cache hit.
[2024-05-21 23:27:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 23:27:33] [INFO ] Invariant cache hit.
[2024-05-21 23:27:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 23:27:33] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:27:33] [INFO ] Invariant cache hit.
[2024-05-21 23:27:33] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 13991ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 13993ms
Finished structural reductions in LTL mode , in 1 iterations and 14302 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 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 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9225 resets) in 97 ms. (408 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3873 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-21 23:27:48] [INFO ] Invariant cache hit.
[2024-05-21 23:27:48] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 5 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9148 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3919 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 34 ms. (steps per millisecond=620 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 34 ms. (steps per millisecond=620 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 154 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37339 reset in 139 ms.
Product exploration explored 100000 steps with 37411 reset in 154 ms.
Built C files in :
/tmp/ltsmin10508811658933204161
[2024-05-21 23:27:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10508811658933204161
Running compilation step : cd /tmp/ltsmin10508811658933204161;'/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 319 ms.
Running link step : cd /tmp/ltsmin10508811658933204161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10508811658933204161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2666939101180905704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 23:28:04] [INFO ] Invariant cache hit.
[2024-05-21 23:28:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 23:28:04] [INFO ] Invariant cache hit.
[2024-05-21 23:28:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 23:28:04] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:28:04] [INFO ] Invariant cache hit.
[2024-05-21 23:28:04] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9438 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14079ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14082ms
Finished structural reductions in LTL mode , in 1 iterations and 14416 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin3082362083934329338
[2024-05-21 23:28:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3082362083934329338
Running compilation step : cd /tmp/ltsmin3082362083934329338;'/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 323 ms.
Running link step : cd /tmp/ltsmin3082362083934329338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3082362083934329338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1386900950371154762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:28:34] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:28:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:34] [INFO ] Time to serialize gal into /tmp/LTL8470913714801479061.gal : 2 ms
[2024-05-21 23:28:34] [INFO ] Time to serialize properties into /tmp/LTL10555757025006971133.prop : 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/LTL8470913714801479061.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3171810644587427924.hoa' '-atoms' '/tmp/LTL10555757025006971133.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/LTL10555757025006971133.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3171810644587427924.hoa
Detected timeout of ITS tools.
[2024-05-21 23:28:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:49] [INFO ] Time to serialize gal into /tmp/LTL15648243617962339560.gal : 1 ms
[2024-05-21 23:28:49] [INFO ] Time to serialize properties into /tmp/LTL4335576197208548541.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/LTL15648243617962339560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4335576197208548541.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 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2024-05-21 23:29:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:29:04] [INFO ] Applying decomposition
[2024-05-21 23:29:04] [INFO ] Flatten gal took : 4 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/graph2006707825188731443.txt' '-o' '/tmp/graph2006707825188731443.bin' '-w' '/tmp/graph2006707825188731443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2006707825188731443.bin' '-l' '-1' '-v' '-w' '/tmp/graph2006707825188731443.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:29:04] [INFO ] Decomposing Gal with order
[2024-05-21 23:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:29:04] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-21 23:29:04] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 5 ms.
[2024-05-21 23:29:04] [INFO ] Time to serialize gal into /tmp/LTL17302174020645707789.gal : 2 ms
[2024-05-21 23:29:04] [INFO ] Time to serialize properties into /tmp/LTL16759702178009953243.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/LTL17302174020645707789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16759702178009953243.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i0.u4.s1>=1)&&(i5.u18.l3659>=1))"))U((X(("((i0.u4.s1>=1)&&(i5.u18.l3659>=1))")||(G(!("((i5.u18.p362>=1)&&(i6.i1.u23.l2...260
Formula 0 simplified : FG(!"((i0.u4.s1<1)||(i5.u18.l3659<1))" | X("((i0.u4.s1>=1)&&(i5.u18.l3659>=1))" M X(!"((i0.u4.s1>=1)&&(i5.u18.l3659>=1))" & F"((i5.u...193
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 123415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
[2024-05-21 23:29:19] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15453910330031381495
[2024-05-21 23:29:19] [INFO ] Computing symmetric may disable matrix : 392 transitions.
[2024-05-21 23:29:19] [INFO ] Applying decomposition
[2024-05-21 23:29:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:19] [INFO ] Computing symmetric may enable matrix : 392 transitions.
[2024-05-21 23:29:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:19] [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/graph2262478963153446001.txt' '-o' '/tmp/graph2262478963153446001.bin' '-w' '/tmp/graph2262478963153446001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2262478963153446001.bin' '-l' '-1' '-v' '-w' '/tmp/graph2262478963153446001.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:29:19] [INFO ] Decomposing Gal with order
[2024-05-21 23:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:29:19] [INFO ] Computing Do-Not-Accords matrix : 392 transitions.
[2024-05-21 23:29:19] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:19] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15453910330031381495
Running compilation step : cd /tmp/ltsmin15453910330031381495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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 23:29:19] [INFO ] Removed a total of 423 redundant transitions.
[2024-05-21 23:29:19] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 8 ms.
[2024-05-21 23:29:19] [INFO ] Time to serialize gal into /tmp/LTLFireability1757563383683805934.gal : 3 ms
[2024-05-21 23:29:19] [INFO ] Time to serialize properties into /tmp/LTLFireability3009728511105176401.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/LTLFireability1757563383683805934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3009728511105176401.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...276
Read 4 LTL properties
Checking formula 0 : !((G(F((!("((i4.u15.p213>=1)&&(i3.i1.u1.l0>=1))"))U(("((!((i0.u0.s1>=1)&&(i4.u15.l3083>=1)))&&(!((i4.u15.p213>=1)&&(i3.i1.u1.l0>=1))))...210
Formula 0 simplified : FG("((i4.u15.p213>=1)&&(i3.i1.u1.l0>=1))" M !"((!((i0.u0.s1>=1)&&(i4.u15.l3083>=1)))&&(!((i4.u15.p213>=1)&&(i3.i1.u1.l0>=1))))")
Compilation finished in 1212 ms.
Running link step : cd /tmp/ltsmin15453910330031381495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15453910330031381495;'/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) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15453910330031381495;'/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) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15453910330031381495;'/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' '[](<>(([](<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15453910330031381495;'/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' '[](<>(([](<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15453910330031381495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp4==true)&&X((!(LTLAPp4==true) U (X(((LTLAPp4==true)||[](!(LTLAPp5==true))))||[](!(LTLAPp4==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15453910330031381495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp4==true)&&X((!(LTLAPp4==true) U (X(((LTLAPp4==true)||[](!(LTLAPp5==true))))||[](!(LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15453910330031381495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15453910330031381495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp6==true))||X(<>((LTLAPp7==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin15453910330031381495;'/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) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-21 23:53:46] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:53:46] [INFO ] Time to serialize gal into /tmp/LTLFireability10677334360112732147.gal : 7 ms
[2024-05-21 23:53:46] [INFO ] Time to serialize properties into /tmp/LTLFireability17090885788458250549.ltl : 124 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/LTLFireability10677334360112732147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17090885788458250549.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...299
Read 4 LTL properties
Checking formula 0 : !((G(F((!("((p213>=1)&&(l0>=1))"))U(("((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")||(G(!("((p213>=1)&&(l0>=1))"))))))))
Formula 0 simplified : FG("((p213>=1)&&(l0>=1))" M !"((!((s1>=1)&&(l3083>=1)))&&(!((p213>=1)&&(l0>=1))))")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15453910330031381495;'/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) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15453910330031381495;'/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' '[](<>(([](<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m10"
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-d2m10, 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-171624189600596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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