About the Execution of ITS-Tools for Anderson-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.359 | 3600000.00 | 10123737.00 | 9502.90 | TFF?FFTFF?T?FFF? | normal |
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.r004-smll-171620118400372.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 Anderson-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 15:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 15:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 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 Anderson-PT-11-LTLFireability-00
FORMULA_NAME Anderson-PT-11-LTLFireability-01
FORMULA_NAME Anderson-PT-11-LTLFireability-02
FORMULA_NAME Anderson-PT-11-LTLFireability-03
FORMULA_NAME Anderson-PT-11-LTLFireability-04
FORMULA_NAME Anderson-PT-11-LTLFireability-05
FORMULA_NAME Anderson-PT-11-LTLFireability-06
FORMULA_NAME Anderson-PT-11-LTLFireability-07
FORMULA_NAME Anderson-PT-11-LTLFireability-08
FORMULA_NAME Anderson-PT-11-LTLFireability-09
FORMULA_NAME Anderson-PT-11-LTLFireability-10
FORMULA_NAME Anderson-PT-11-LTLFireability-11
FORMULA_NAME Anderson-PT-11-LTLFireability-12
FORMULA_NAME Anderson-PT-11-LTLFireability-13
FORMULA_NAME Anderson-PT-11-LTLFireability-14
FORMULA_NAME Anderson-PT-11-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716455164988
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 09:06:07] [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-23 09:06:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 09:06:08] [INFO ] Load time of PNML (sax parser for PT used): 584 ms
[2024-05-23 09:06:08] [INFO ] Transformed 749 places.
[2024-05-23 09:06:08] [INFO ] Transformed 3245 transitions.
[2024-05-23 09:06:08] [INFO ] Found NUPN structural information;
[2024-05-23 09:06:08] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 857 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Anderson-PT-11-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 546 transition count 1182
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 546 transition count 1182
Applied a total of 406 rules in 159 ms. Remains 546 /749 variables (removed 203) and now considering 1182/3245 (removed 2063) transitions.
// Phase 1: matrix 1182 rows 546 cols
[2024-05-23 09:06:08] [INFO ] Computed 25 invariants in 89 ms
[2024-05-23 09:06:10] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2024-05-23 09:06:10] [INFO ] Invariant cache hit.
[2024-05-23 09:06:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:06:15] [INFO ] Implicit Places using invariants and state equation in 5690 ms returned []
Implicit Place search using SMT with State Equation took 6986 ms to find 0 implicit places.
Running 1171 sub problems to find dead transitions.
[2024-05-23 09:06:15] [INFO ] Invariant cache hit.
[2024-05-23 09:06:15] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1171 unsolved
[2024-05-23 09:06:38] [INFO ] Deduced a trap composed of 137 places in 778 ms of which 62 ms to minimize.
[2024-05-23 09:06:39] [INFO ] Deduced a trap composed of 82 places in 767 ms of which 8 ms to minimize.
[2024-05-23 09:06:40] [INFO ] Deduced a trap composed of 211 places in 732 ms of which 6 ms to minimize.
[2024-05-23 09:06:40] [INFO ] Deduced a trap composed of 193 places in 615 ms of which 8 ms to minimize.
[2024-05-23 09:06:41] [INFO ] Deduced a trap composed of 143 places in 593 ms of which 8 ms to minimize.
[2024-05-23 09:06:42] [INFO ] Deduced a trap composed of 278 places in 585 ms of which 7 ms to minimize.
[2024-05-23 09:06:42] [INFO ] Deduced a trap composed of 119 places in 505 ms of which 5 ms to minimize.
[2024-05-23 09:06:43] [INFO ] Deduced a trap composed of 87 places in 589 ms of which 7 ms to minimize.
[2024-05-23 09:06:43] [INFO ] Deduced a trap composed of 82 places in 506 ms of which 5 ms to minimize.
[2024-05-23 09:06:44] [INFO ] Deduced a trap composed of 316 places in 507 ms of which 5 ms to minimize.
[2024-05-23 09:06:45] [INFO ] Deduced a trap composed of 187 places in 605 ms of which 6 ms to minimize.
[2024-05-23 09:06:45] [INFO ] Deduced a trap composed of 208 places in 486 ms of which 5 ms to minimize.
[2024-05-23 09:06:46] [INFO ] Deduced a trap composed of 144 places in 598 ms of which 7 ms to minimize.
[2024-05-23 09:06:47] [INFO ] Deduced a trap composed of 136 places in 499 ms of which 6 ms to minimize.
[2024-05-23 09:06:47] [INFO ] Deduced a trap composed of 124 places in 565 ms of which 6 ms to minimize.
[2024-05-23 09:06:48] [INFO ] Deduced a trap composed of 153 places in 675 ms of which 8 ms to minimize.
[2024-05-23 09:06:49] [INFO ] Deduced a trap composed of 271 places in 774 ms of which 9 ms to minimize.
SMT process timed out in 33240ms, After SMT, problems are : Problem set: 0 solved, 1171 unsolved
Search for dead transitions found 0 dead transitions in 33302ms
Starting structural reductions in LTL mode, iteration 1 : 546/749 places, 1182/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40497 ms. Remains : 546/749 places, 1182/3245 transitions.
Support contains 32 out of 546 places after structural reductions.
[2024-05-23 09:06:49] [INFO ] Flatten gal took : 262 ms
[2024-05-23 09:06:49] [INFO ] Flatten gal took : 159 ms
[2024-05-23 09:06:50] [INFO ] Input system was already deterministic with 1182 transitions.
RANDOM walk for 40000 steps (8 resets) in 3267 ms. (12 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 302 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
[2024-05-23 09:06:51] [INFO ] Invariant cache hit.
[2024-05-23 09:06:51] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 515/532 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/536 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 6 (OVERLAPS) 10/546 variables, 10/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1182/1728 variables, 546/571 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1728 variables, 110/681 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1728 variables, 0/681 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1728 variables, 0/681 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1728/1728 variables, and 681 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 546/546 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 516/530 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/535 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 11/546 variables, 11/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 09:06:55] [INFO ] Deduced a trap composed of 273 places in 402 ms of which 5 ms to minimize.
[2024-05-23 09:06:55] [INFO ] Deduced a trap composed of 163 places in 559 ms of which 6 ms to minimize.
[2024-05-23 09:06:56] [INFO ] Deduced a trap composed of 199 places in 579 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1182/1728 variables, 546/574 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1728 variables, 110/684 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1728 variables, 8/692 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 692 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 546/546 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 6902ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 231 place count 425 transition count 841
Iterating global reduction 0 with 11 rules applied. Total rules applied 242 place count 425 transition count 841
Applied a total of 242 rules in 143 ms. Remains 425 /546 variables (removed 121) and now considering 841/1182 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 425/546 places, 841/1182 transitions.
RANDOM walk for 40000 steps (8 resets) in 689 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
// Phase 1: matrix 841 rows 425 cols
[2024-05-23 09:06:59] [INFO ] Computed 25 invariants in 13 ms
[2024-05-23 09:06:59] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 399/408 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/414 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/425 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 841/1266 variables, 425/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 110/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1266 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1266/1266 variables, and 560 constraints, problems are : Problem set: 0 solved, 4 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 425/425 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 399/408 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/414 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/425 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 841/1266 variables, 425/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 110/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1266 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1266 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1266/1266 variables, and 564 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 425/425 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4937ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2267 ms.
Support contains 9 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 841/841 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 423 transition count 799
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 423 transition count 799
Applied a total of 4 rules in 75 ms. Remains 423 /425 variables (removed 2) and now considering 799/841 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 423/425 places, 799/841 transitions.
RANDOM walk for 40000 steps (8 resets) in 310 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 233449 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :1 out of 4
Probabilistic random walk after 233449 steps, saw 182908 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :1
// Phase 1: matrix 799 rows 423 cols
[2024-05-23 09:07:10] [INFO ] Computed 25 invariants in 18 ms
[2024-05-23 09:07:10] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 398/405 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/412 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/423 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 799/1222 variables, 423/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1222 variables, 110/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1222 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1222 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 558 constraints, problems are : Problem set: 0 solved, 3 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 423/423 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 398/405 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/412 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/423 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 799/1222 variables, 423/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1222 variables, 110/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1222 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1222 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1222 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10761 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 423/423 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 11666ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 579 ms.
Support contains 7 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 799/799 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 422 transition count 778
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 778
Applied a total of 2 rules in 57 ms. Remains 422 /423 variables (removed 1) and now considering 778/799 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 422/423 places, 778/799 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 274942 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 3
Probabilistic random walk after 274942 steps, saw 217995 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 778 rows 422 cols
[2024-05-23 09:07:25] [INFO ] Computed 25 invariants in 7 ms
[2024-05-23 09:07:25] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 397/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/411 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/422 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 778/1200 variables, 422/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1200 variables, 110/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1200 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 557 constraints, problems are : Problem set: 0 solved, 3 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 422/422 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 397/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/411 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/422 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 778/1200 variables, 422/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1200 variables, 110/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1200 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1200 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1200/1200 variables, and 560 constraints, problems are : Problem set: 0 solved, 3 unsolved in 20935 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 422/422 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 21557ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2727 ms.
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 778/778 transitions.
Applied a total of 0 rules in 27 ms. Remains 422 /422 variables (removed 0) and now considering 778/778 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 422/422 places, 778/778 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 778/778 transitions.
Applied a total of 0 rules in 27 ms. Remains 422 /422 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2024-05-23 09:07:50] [INFO ] Invariant cache hit.
[2024-05-23 09:07:50] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-23 09:07:50] [INFO ] Invariant cache hit.
[2024-05-23 09:07:51] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:07:53] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
[2024-05-23 09:07:53] [INFO ] Redundant transitions in 65 ms returned []
Running 767 sub problems to find dead transitions.
[2024-05-23 09:07:53] [INFO ] Invariant cache hit.
[2024-05-23 09:07:53] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-23 09:08:06] [INFO ] Deduced a trap composed of 190 places in 472 ms of which 7 ms to minimize.
[2024-05-23 09:08:08] [INFO ] Deduced a trap composed of 155 places in 586 ms of which 7 ms to minimize.
[2024-05-23 09:08:09] [INFO ] Deduced a trap composed of 129 places in 460 ms of which 5 ms to minimize.
[2024-05-23 09:08:11] [INFO ] Deduced a trap composed of 141 places in 338 ms of which 4 ms to minimize.
[2024-05-23 09:08:12] [INFO ] Deduced a trap composed of 209 places in 431 ms of which 7 ms to minimize.
[2024-05-23 09:08:13] [INFO ] Deduced a trap composed of 122 places in 580 ms of which 7 ms to minimize.
[2024-05-23 09:08:14] [INFO ] Deduced a trap composed of 107 places in 522 ms of which 6 ms to minimize.
[2024-05-23 09:08:14] [INFO ] Deduced a trap composed of 187 places in 453 ms of which 4 ms to minimize.
[2024-05-23 09:08:15] [INFO ] Deduced a trap composed of 122 places in 388 ms of which 5 ms to minimize.
[2024-05-23 09:08:15] [INFO ] Deduced a trap composed of 111 places in 418 ms of which 4 ms to minimize.
[2024-05-23 09:08:16] [INFO ] Deduced a trap composed of 118 places in 415 ms of which 4 ms to minimize.
[2024-05-23 09:08:16] [INFO ] Deduced a trap composed of 185 places in 431 ms of which 4 ms to minimize.
[2024-05-23 09:08:16] [INFO ] Deduced a trap composed of 169 places in 387 ms of which 4 ms to minimize.
[2024-05-23 09:08:17] [INFO ] Deduced a trap composed of 225 places in 432 ms of which 5 ms to minimize.
[2024-05-23 09:08:17] [INFO ] Deduced a trap composed of 98 places in 426 ms of which 4 ms to minimize.
[2024-05-23 09:08:18] [INFO ] Deduced a trap composed of 110 places in 427 ms of which 5 ms to minimize.
[2024-05-23 09:08:18] [INFO ] Deduced a trap composed of 135 places in 429 ms of which 4 ms to minimize.
[2024-05-23 09:08:19] [INFO ] Deduced a trap composed of 110 places in 373 ms of which 5 ms to minimize.
[2024-05-23 09:08:19] [INFO ] Deduced a trap composed of 139 places in 446 ms of which 4 ms to minimize.
[2024-05-23 09:08:19] [INFO ] Deduced a trap composed of 71 places in 391 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-23 09:08:23] [INFO ] Deduced a trap composed of 164 places in 457 ms of which 5 ms to minimize.
[2024-05-23 09:08:23] [INFO ] Deduced a trap composed of 166 places in 482 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1200 variables, and 47 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/422 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-23 09:08:32] [INFO ] Deduced a trap composed of 220 places in 464 ms of which 5 ms to minimize.
[2024-05-23 09:08:33] [INFO ] Deduced a trap composed of 114 places in 506 ms of which 4 ms to minimize.
[2024-05-23 09:08:33] [INFO ] Deduced a trap composed of 194 places in 472 ms of which 5 ms to minimize.
[2024-05-23 09:08:34] [INFO ] Deduced a trap composed of 139 places in 459 ms of which 5 ms to minimize.
[2024-05-23 09:08:34] [INFO ] Deduced a trap composed of 197 places in 493 ms of which 7 ms to minimize.
[2024-05-23 09:08:36] [INFO ] Deduced a trap composed of 114 places in 453 ms of which 5 ms to minimize.
[2024-05-23 09:08:36] [INFO ] Deduced a trap composed of 131 places in 373 ms of which 4 ms to minimize.
[2024-05-23 09:08:37] [INFO ] Deduced a trap composed of 113 places in 480 ms of which 7 ms to minimize.
[2024-05-23 09:08:38] [INFO ] Deduced a trap composed of 255 places in 375 ms of which 5 ms to minimize.
[2024-05-23 09:08:38] [INFO ] Deduced a trap composed of 191 places in 382 ms of which 4 ms to minimize.
[2024-05-23 09:08:39] [INFO ] Deduced a trap composed of 155 places in 321 ms of which 4 ms to minimize.
[2024-05-23 09:08:39] [INFO ] Deduced a trap composed of 127 places in 484 ms of which 7 ms to minimize.
[2024-05-23 09:08:41] [INFO ] Deduced a trap composed of 102 places in 367 ms of which 4 ms to minimize.
[2024-05-23 09:08:42] [INFO ] Deduced a trap composed of 217 places in 484 ms of which 7 ms to minimize.
[2024-05-23 09:08:42] [INFO ] Deduced a trap composed of 126 places in 376 ms of which 4 ms to minimize.
[2024-05-23 09:08:43] [INFO ] Deduced a trap composed of 232 places in 484 ms of which 4 ms to minimize.
[2024-05-23 09:08:43] [INFO ] Deduced a trap composed of 170 places in 493 ms of which 5 ms to minimize.
[2024-05-23 09:08:44] [INFO ] Deduced a trap composed of 133 places in 478 ms of which 5 ms to minimize.
[2024-05-23 09:08:44] [INFO ] Deduced a trap composed of 127 places in 366 ms of which 4 ms to minimize.
[2024-05-23 09:08:44] [INFO ] Deduced a trap composed of 118 places in 482 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-23 09:08:49] [INFO ] Deduced a trap composed of 111 places in 450 ms of which 7 ms to minimize.
[2024-05-23 09:08:49] [INFO ] Deduced a trap composed of 196 places in 368 ms of which 5 ms to minimize.
[2024-05-23 09:08:50] [INFO ] Deduced a trap composed of 137 places in 346 ms of which 4 ms to minimize.
[2024-05-23 09:08:50] [INFO ] Deduced a trap composed of 186 places in 377 ms of which 4 ms to minimize.
[2024-05-23 09:08:51] [INFO ] Deduced a trap composed of 192 places in 356 ms of which 4 ms to minimize.
[2024-05-23 09:08:52] [INFO ] Deduced a trap composed of 211 places in 361 ms of which 5 ms to minimize.
[2024-05-23 09:08:52] [INFO ] Deduced a trap composed of 186 places in 356 ms of which 4 ms to minimize.
[2024-05-23 09:08:53] [INFO ] Deduced a trap composed of 119 places in 358 ms of which 4 ms to minimize.
[2024-05-23 09:08:53] [INFO ] Deduced a trap composed of 213 places in 350 ms of which 4 ms to minimize.
[2024-05-23 09:08:53] [INFO ] Deduced a trap composed of 153 places in 350 ms of which 4 ms to minimize.
[2024-05-23 09:08:54] [INFO ] Deduced a trap composed of 139 places in 453 ms of which 7 ms to minimize.
[2024-05-23 09:08:55] [INFO ] Deduced a trap composed of 149 places in 582 ms of which 7 ms to minimize.
[2024-05-23 09:08:55] [INFO ] Deduced a trap composed of 143 places in 533 ms of which 7 ms to minimize.
SMT process timed out in 62019ms, After SMT, problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 62032ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65641 ms. Remains : 422/422 places, 778/778 transitions.
FORMULA Anderson-PT-11-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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(X(X(F(p0))))))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 846
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 846
Applied a total of 32 rules in 24 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-05-23 09:08:56] [INFO ] Computed 25 invariants in 8 ms
[2024-05-23 09:08:57] [INFO ] Implicit Places using invariants in 935 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 942 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/546 places, 846/1182 transitions.
Applied a total of 0 rules in 12 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 978 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 548 ms.
Stack based approach found an accepted trace after 150 steps with 0 reset with depth 151 and stack size 151 in 3 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 1988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 846
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 846
Applied a total of 32 rules in 39 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-05-23 09:08:58] [INFO ] Computed 25 invariants in 11 ms
[2024-05-23 09:08:59] [INFO ] Implicit Places using invariants in 1154 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/546 places, 846/1182 transitions.
Applied a total of 0 rules in 19 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1215 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 279 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-02 finished in 1700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p0&&X(X(G(p2))))))'
Support contains 5 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 532 transition count 888
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 532 transition count 888
Applied a total of 28 rules in 28 ms. Remains 532 /546 variables (removed 14) and now considering 888/1182 (removed 294) transitions.
// Phase 1: matrix 888 rows 532 cols
[2024-05-23 09:08:59] [INFO ] Computed 25 invariants in 13 ms
[2024-05-23 09:09:00] [INFO ] Implicit Places using invariants in 920 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 923 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/546 places, 888/1182 transitions.
Applied a total of 0 rules in 12 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 964 ms. Remains : 531/546 places, 888/1182 transitions.
Stuttering acceptance computed with spot in 550 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 269 ms.
Product exploration explored 100000 steps with 0 reset in 510 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 128 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 232968 steps, run visited all 1 properties in 779 ms. (steps per millisecond=299 )
Probabilistic random walk after 232968 steps, saw 182967 distinct states, run finished after 784 ms. (steps per millisecond=297 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 20 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 531 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2024-05-23 09:09:03] [INFO ] Computed 24 invariants in 20 ms
[2024-05-23 09:09:04] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-23 09:09:04] [INFO ] Invariant cache hit.
[2024-05-23 09:09:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:09:10] [INFO ] Implicit Places using invariants and state equation in 5529 ms returned []
Implicit Place search using SMT with State Equation took 6317 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2024-05-23 09:09:10] [INFO ] Invariant cache hit.
[2024-05-23 09:09:10] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
[2024-05-23 09:09:27] [INFO ] Deduced a trap composed of 298 places in 763 ms of which 9 ms to minimize.
[2024-05-23 09:09:28] [INFO ] Deduced a trap composed of 339 places in 696 ms of which 8 ms to minimize.
[2024-05-23 09:09:29] [INFO ] Deduced a trap composed of 167 places in 695 ms of which 8 ms to minimize.
[2024-05-23 09:09:36] [INFO ] Deduced a trap composed of 152 places in 677 ms of which 9 ms to minimize.
[2024-05-23 09:09:37] [INFO ] Deduced a trap composed of 188 places in 710 ms of which 9 ms to minimize.
[2024-05-23 09:09:40] [INFO ] Deduced a trap composed of 133 places in 639 ms of which 9 ms to minimize.
[2024-05-23 09:09:41] [INFO ] Deduced a trap composed of 168 places in 703 ms of which 8 ms to minimize.
SMT process timed out in 30945ms, After SMT, problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 30963ms
Finished structural reductions in LTL mode , in 1 iterations and 37315 ms. Remains : 531/531 places, 888/888 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35478 steps (7 resets) in 112 ms. (313 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 300 ms.
Product exploration explored 100000 steps with 0 reset in 331 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 119 place count 531 transition count 888
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 229 place count 531 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 530 transition count 867
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 530 transition count 867
Deduced a syphon composed of 229 places in 1 ms
Applied a total of 231 rules in 293 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
[2024-05-23 09:09:43] [INFO ] Redundant transitions in 106 ms returned []
Running 856 sub problems to find dead transitions.
// Phase 1: matrix 867 rows 530 cols
[2024-05-23 09:09:43] [INFO ] Computed 24 invariants in 11 ms
[2024-05-23 09:09:43] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 856 unsolved
[2024-05-23 09:10:00] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-23 09:10:01] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-23 09:10:01] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-23 09:10:02] [INFO ] Deduced a trap composed of 13 places in 692 ms of which 8 ms to minimize.
[2024-05-23 09:10:02] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-23 09:10:02] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-23 09:10:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-23 09:10:02] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-23 09:10:03] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-23 09:10:03] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-23 09:10:03] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-23 09:10:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-23 09:10:05] [INFO ] Deduced a trap composed of 123 places in 628 ms of which 8 ms to minimize.
[2024-05-23 09:10:06] [INFO ] Deduced a trap composed of 121 places in 511 ms of which 8 ms to minimize.
[2024-05-23 09:10:07] [INFO ] Deduced a trap composed of 88 places in 696 ms of which 8 ms to minimize.
[2024-05-23 09:10:07] [INFO ] Deduced a trap composed of 79 places in 651 ms of which 8 ms to minimize.
[2024-05-23 09:10:08] [INFO ] Deduced a trap composed of 137 places in 666 ms of which 9 ms to minimize.
[2024-05-23 09:10:09] [INFO ] Deduced a trap composed of 106 places in 620 ms of which 9 ms to minimize.
[2024-05-23 09:10:09] [INFO ] Deduced a trap composed of 103 places in 697 ms of which 8 ms to minimize.
[2024-05-23 09:10:10] [INFO ] Deduced a trap composed of 115 places in 728 ms of which 9 ms to minimize.
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 20/44 constraints. Problems are: Problem set: 229 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1397 variables, and 44 constraints, problems are : Problem set: 229 solved, 627 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/530 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 856/856 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 229 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 20/20 constraints. Problems are: Problem set: 229 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/20 constraints. Problems are: Problem set: 229 solved, 627 unsolved
At refinement iteration 2 (OVERLAPS) 229/530 variables, 12/32 constraints. Problems are: Problem set: 229 solved, 627 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 12/44 constraints. Problems are: Problem set: 229 solved, 627 unsolved
[2024-05-23 09:10:27] [INFO ] Deduced a trap composed of 99 places in 709 ms of which 9 ms to minimize.
[2024-05-23 09:10:28] [INFO ] Deduced a trap composed of 77 places in 564 ms of which 8 ms to minimize.
[2024-05-23 09:10:31] [INFO ] Deduced a trap composed of 125 places in 706 ms of which 9 ms to minimize.
[2024-05-23 09:10:32] [INFO ] Deduced a trap composed of 96 places in 547 ms of which 7 ms to minimize.
[2024-05-23 09:10:33] [INFO ] Deduced a trap composed of 117 places in 567 ms of which 7 ms to minimize.
[2024-05-23 09:10:33] [INFO ] Deduced a trap composed of 115 places in 613 ms of which 8 ms to minimize.
[2024-05-23 09:10:34] [INFO ] Deduced a trap composed of 82 places in 685 ms of which 8 ms to minimize.
[2024-05-23 09:10:35] [INFO ] Deduced a trap composed of 125 places in 633 ms of which 8 ms to minimize.
[2024-05-23 09:10:35] [INFO ] Deduced a trap composed of 105 places in 660 ms of which 8 ms to minimize.
[2024-05-23 09:10:36] [INFO ] Deduced a trap composed of 92 places in 652 ms of which 8 ms to minimize.
[2024-05-23 09:10:37] [INFO ] Deduced a trap composed of 64 places in 654 ms of which 8 ms to minimize.
[2024-05-23 09:10:37] [INFO ] Deduced a trap composed of 134 places in 634 ms of which 8 ms to minimize.
[2024-05-23 09:10:38] [INFO ] Deduced a trap composed of 97 places in 658 ms of which 8 ms to minimize.
[2024-05-23 09:10:39] [INFO ] Deduced a trap composed of 119 places in 653 ms of which 9 ms to minimize.
[2024-05-23 09:10:39] [INFO ] Deduced a trap composed of 101 places in 670 ms of which 8 ms to minimize.
[2024-05-23 09:10:40] [INFO ] Deduced a trap composed of 94 places in 564 ms of which 9 ms to minimize.
[2024-05-23 09:10:41] [INFO ] Deduced a trap composed of 92 places in 609 ms of which 5 ms to minimize.
[2024-05-23 09:10:41] [INFO ] Deduced a trap composed of 84 places in 381 ms of which 5 ms to minimize.
[2024-05-23 09:10:41] [INFO ] Deduced a trap composed of 98 places in 415 ms of which 5 ms to minimize.
[2024-05-23 09:10:42] [INFO ] Deduced a trap composed of 94 places in 417 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/64 constraints. Problems are: Problem set: 229 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1397 variables, and 64 constraints, problems are : Problem set: 229 solved, 627 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/530 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/856 constraints, Known Traps: 40/40 constraints]
After SMT, in 60952ms problems are : Problem set: 229 solved, 627 unsolved
Search for dead transitions found 229 dead transitions in 60968ms
Found 229 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 229 transitions
Dead transitions reduction (with SMT) removed 229 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 530/531 places, 638/888 transitions.
Graph (complete) has 1682 edges and 530 vertex of which 301 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.5 ms
Discarding 229 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 301 /530 variables (removed 229) and now considering 638/638 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/531 places, 638/888 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61407 ms. Remains : 301/531 places, 638/888 transitions.
Built C files in :
/tmp/ltsmin15973421824505991535
[2024-05-23 09:10:44] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15973421824505991535
Running compilation step : cd /tmp/ltsmin15973421824505991535;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15973421824505991535;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15973421824505991535;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 530 transition count 867
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 530 transition count 867
Applied a total of 2 rules in 24 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
// Phase 1: matrix 867 rows 530 cols
[2024-05-23 09:10:48] [INFO ] Computed 24 invariants in 9 ms
[2024-05-23 09:10:48] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-05-23 09:10:48] [INFO ] Invariant cache hit.
[2024-05-23 09:10:49] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:10:55] [INFO ] Implicit Places using invariants and state equation in 6277 ms returned []
Implicit Place search using SMT with State Equation took 7057 ms to find 0 implicit places.
Running 856 sub problems to find dead transitions.
[2024-05-23 09:10:55] [INFO ] Invariant cache hit.
[2024-05-23 09:10:55] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 856 unsolved
[2024-05-23 09:11:19] [INFO ] Deduced a trap composed of 233 places in 681 ms of which 8 ms to minimize.
[2024-05-23 09:11:20] [INFO ] Deduced a trap composed of 104 places in 685 ms of which 8 ms to minimize.
[2024-05-23 09:11:21] [INFO ] Deduced a trap composed of 191 places in 662 ms of which 8 ms to minimize.
[2024-05-23 09:11:22] [INFO ] Deduced a trap composed of 184 places in 681 ms of which 8 ms to minimize.
[2024-05-23 09:11:26] [INFO ] Deduced a trap composed of 337 places in 681 ms of which 8 ms to minimize.
SMT process timed out in 31522ms, After SMT, problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 31542ms
Starting structural reductions in LTL mode, iteration 1 : 530/531 places, 867/888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38627 ms. Remains : 530/531 places, 867/888 transitions.
Built C files in :
/tmp/ltsmin5395615602869766835
[2024-05-23 09:11:26] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5395615602869766835
Running compilation step : cd /tmp/ltsmin5395615602869766835;'/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 2963 ms.
Running link step : cd /tmp/ltsmin5395615602869766835;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5395615602869766835;'/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/stateBased10674625120377370504.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 09:11:41] [INFO ] Flatten gal took : 52 ms
[2024-05-23 09:11:42] [INFO ] Flatten gal took : 51 ms
[2024-05-23 09:11:42] [INFO ] Time to serialize gal into /tmp/LTL12099754903675859459.gal : 15 ms
[2024-05-23 09:11:42] [INFO ] Time to serialize properties into /tmp/LTL11857879571502777068.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12099754903675859459.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9331319153304705957.hoa' '-atoms' '/tmp/LTL11857879571502777068.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/LTL11857879571502777068.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9331319153304705957.hoa
Detected timeout of ITS tools.
[2024-05-23 09:11:57] [INFO ] Flatten gal took : 49 ms
[2024-05-23 09:11:57] [INFO ] Flatten gal took : 37 ms
[2024-05-23 09:11:57] [INFO ] Time to serialize gal into /tmp/LTL7202506572933525056.gal : 14 ms
[2024-05-23 09:11:57] [INFO ] Time to serialize properties into /tmp/LTL2102973065311932599.ltl : 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/LTL7202506572933525056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2102973065311932599.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 : !(((("((next_16==1)&&(ncs_0_8==1))")U("((next_13==1)&&(ncs_8_5==1))"))U((!("((next_16==1)&&(ncs_0_8==1))"))&&(X(X(G("(((next_13==1)&&(...209
Formula 0 simplified : (!"((next_16==1)&&(ncs_0_8==1))" R !"((next_13==1)&&(ncs_8_5==1))") R ("((next_16==1)&&(ncs_0_8==1))" | XXF!"(((next_13==1)&&(ncs_6_...197
Detected timeout of ITS tools.
[2024-05-23 09:12:12] [INFO ] Flatten gal took : 32 ms
[2024-05-23 09:12:12] [INFO ] Applying decomposition
[2024-05-23 09:12:12] [INFO ] Flatten gal took : 33 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/graph5207849789482549892.txt' '-o' '/tmp/graph5207849789482549892.bin' '-w' '/tmp/graph5207849789482549892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5207849789482549892.bin' '-l' '-1' '-v' '-w' '/tmp/graph5207849789482549892.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:12:12] [INFO ] Decomposing Gal with order
[2024-05-23 09:12:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:12:12] [INFO ] Removed a total of 1540 redundant transitions.
[2024-05-23 09:12:12] [INFO ] Flatten gal took : 155 ms
[2024-05-23 09:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 29 ms.
[2024-05-23 09:12:12] [INFO ] Time to serialize gal into /tmp/LTL1085496525960533232.gal : 20 ms
[2024-05-23 09:12:12] [INFO ] Time to serialize properties into /tmp/LTL687151862822968370.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/LTL1085496525960533232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL687151862822968370.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...253
Read 1 LTL properties
Checking formula 0 : !(((("((i0.i2.u6.next_16==1)&&(i0.i1.u9.ncs_0_8==1))")U("((i0.i1.u5.next_13==1)&&(i2.u54.ncs_8_5==1))"))U((!("((i0.i2.u6.next_16==1)&&...294
Formula 0 simplified : (!"((i0.i2.u6.next_16==1)&&(i0.i1.u9.ncs_0_8==1))" R !"((i0.i1.u5.next_13==1)&&(i2.u54.ncs_8_5==1))") R ("((i0.i2.u6.next_16==1)&&(i...282
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 208303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 846
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 846
Applied a total of 32 rules in 27 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-05-23 09:12:28] [INFO ] Computed 25 invariants in 8 ms
[2024-05-23 09:12:29] [INFO ] Implicit Places using invariants in 1015 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/546 places, 846/1182 transitions.
Applied a total of 0 rules in 13 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1060 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : Anderson-PT-11-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 518 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-06 finished in 2147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)||X(F(p2)))))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 846
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 846
Applied a total of 32 rules in 24 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-05-23 09:12:30] [INFO ] Computed 25 invariants in 8 ms
[2024-05-23 09:12:31] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2024-05-23 09:12:31] [INFO ] Invariant cache hit.
[2024-05-23 09:12:32] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:12:36] [INFO ] Implicit Places using invariants and state equation in 5165 ms returned []
Implicit Place search using SMT with State Equation took 6219 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2024-05-23 09:12:36] [INFO ] Invariant cache hit.
[2024-05-23 09:12:36] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:12:59] [INFO ] Deduced a trap composed of 231 places in 711 ms of which 12 ms to minimize.
[2024-05-23 09:13:00] [INFO ] Deduced a trap composed of 209 places in 456 ms of which 5 ms to minimize.
[2024-05-23 09:13:01] [INFO ] Deduced a trap composed of 118 places in 375 ms of which 5 ms to minimize.
[2024-05-23 09:13:01] [INFO ] Deduced a trap composed of 73 places in 493 ms of which 6 ms to minimize.
[2024-05-23 09:13:02] [INFO ] Deduced a trap composed of 87 places in 673 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1376 variables, and 30 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:13:17] [INFO ] Deduced a trap composed of 115 places in 716 ms of which 9 ms to minimize.
[2024-05-23 09:13:18] [INFO ] Deduced a trap composed of 188 places in 624 ms of which 8 ms to minimize.
[2024-05-23 09:13:19] [INFO ] Deduced a trap composed of 217 places in 716 ms of which 8 ms to minimize.
[2024-05-23 09:13:19] [INFO ] Deduced a trap composed of 307 places in 726 ms of which 9 ms to minimize.
[2024-05-23 09:13:20] [INFO ] Deduced a trap composed of 163 places in 707 ms of which 8 ms to minimize.
[2024-05-23 09:13:21] [INFO ] Deduced a trap composed of 150 places in 632 ms of which 9 ms to minimize.
[2024-05-23 09:13:22] [INFO ] Deduced a trap composed of 154 places in 724 ms of which 8 ms to minimize.
[2024-05-23 09:13:22] [INFO ] Deduced a trap composed of 200 places in 747 ms of which 8 ms to minimize.
[2024-05-23 09:13:23] [INFO ] Deduced a trap composed of 98 places in 632 ms of which 8 ms to minimize.
[2024-05-23 09:13:24] [INFO ] Deduced a trap composed of 215 places in 672 ms of which 8 ms to minimize.
[2024-05-23 09:13:25] [INFO ] Deduced a trap composed of 136 places in 691 ms of which 8 ms to minimize.
[2024-05-23 09:13:25] [INFO ] Deduced a trap composed of 232 places in 699 ms of which 8 ms to minimize.
[2024-05-23 09:13:35] [INFO ] Deduced a trap composed of 272 places in 447 ms of which 5 ms to minimize.
[2024-05-23 09:13:35] [INFO ] Deduced a trap composed of 240 places in 458 ms of which 6 ms to minimize.
[2024-05-23 09:13:36] [INFO ] Deduced a trap composed of 113 places in 565 ms of which 7 ms to minimize.
[2024-05-23 09:13:36] [INFO ] Deduced a trap composed of 87 places in 654 ms of which 8 ms to minimize.
[2024-05-23 09:13:37] [INFO ] Deduced a trap composed of 190 places in 602 ms of which 5 ms to minimize.
[2024-05-23 09:13:37] [INFO ] Deduced a trap composed of 189 places in 443 ms of which 5 ms to minimize.
SMT process timed out in 61432ms, After SMT, problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 61445ms
Starting structural reductions in LTL mode, iteration 1 : 530/546 places, 846/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67691 ms. Remains : 530/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 279 ms.
Stack based approach found an accepted trace after 3148 steps with 0 reset with depth 3149 and stack size 2463 in 13 ms.
FORMULA Anderson-PT-11-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-07 finished in 68168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 235 place count 421 transition count 757
Iterating global reduction 0 with 15 rules applied. Total rules applied 250 place count 421 transition count 757
Applied a total of 250 rules in 46 ms. Remains 421 /546 variables (removed 125) and now considering 757/1182 (removed 425) transitions.
// Phase 1: matrix 757 rows 421 cols
[2024-05-23 09:13:38] [INFO ] Computed 25 invariants in 9 ms
[2024-05-23 09:13:39] [INFO ] Implicit Places using invariants in 914 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 915 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/546 places, 757/1182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 18 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2024-05-23 09:13:39] [INFO ] Computed 24 invariants in 8 ms
[2024-05-23 09:13:39] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-23 09:13:39] [INFO ] Invariant cache hit.
[2024-05-23 09:13:40] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:13:41] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/546 places, 638/1182 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2962 ms. Remains : 301/546 places, 638/1182 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 3284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 530 transition count 846
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 530 transition count 846
Applied a total of 32 rules in 25 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-05-23 09:13:41] [INFO ] Computed 25 invariants in 13 ms
[2024-05-23 09:13:42] [INFO ] Implicit Places using invariants in 1074 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/546 places, 846/1182 transitions.
Applied a total of 0 rules in 13 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1119 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 190 ms.
Product exploration explored 100000 steps with 0 reset in 266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 754255 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 754255 steps, saw 577739 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 846 rows 529 cols
[2024-05-23 09:13:46] [INFO ] Computed 24 invariants in 7 ms
[2024-05-23 09:13:46] [INFO ] State equation strengthened by 110 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) 495/497 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/518 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1375 variables, 529/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1375 variables, 110/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1375 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1375 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1375/1375 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 529/529 constraints, ReadFeed: 110/110 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) 495/497 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/518 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1375 variables, 529/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1375 variables, 110/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1375 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1375 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1375 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1375/1375 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 529/529 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 846/846 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 726
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 409 transition count 726
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 409 transition count 616
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 298 transition count 615
Applied a total of 462 rules in 49 ms. Remains 298 /529 variables (removed 231) and now considering 615/846 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 298/529 places, 615/846 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 837510 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 837510 steps, saw 630697 distinct states, run finished after 3004 ms. (steps per millisecond=278 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2024-05-23 09:13:51] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 09:13:51] [INFO ] State equation strengthened by 110 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) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 09:13:51] [INFO ] Deduced a trap composed of 90 places in 257 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 615/913 variables, 298/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 615/913 variables, 298/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/913 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/913 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1470ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 13 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 298/298 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 12 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-05-23 09:13:53] [INFO ] Invariant cache hit.
[2024-05-23 09:13:53] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-23 09:13:53] [INFO ] Invariant cache hit.
[2024-05-23 09:13:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:13:54] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-23 09:13:54] [INFO ] Redundant transitions in 4 ms returned []
Running 604 sub problems to find dead transitions.
[2024-05-23 09:13:54] [INFO ] Invariant cache hit.
[2024-05-23 09:13:54] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-23 09:14:01] [INFO ] Deduced a trap composed of 109 places in 334 ms of which 4 ms to minimize.
[2024-05-23 09:14:02] [INFO ] Deduced a trap composed of 77 places in 236 ms of which 4 ms to minimize.
[2024-05-23 09:14:02] [INFO ] Deduced a trap composed of 102 places in 250 ms of which 3 ms to minimize.
[2024-05-23 09:14:02] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 3 ms to minimize.
[2024-05-23 09:14:02] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 3 ms to minimize.
[2024-05-23 09:14:03] [INFO ] Deduced a trap composed of 86 places in 201 ms of which 3 ms to minimize.
[2024-05-23 09:14:03] [INFO ] Deduced a trap composed of 103 places in 244 ms of which 3 ms to minimize.
[2024-05-23 09:14:03] [INFO ] Deduced a trap composed of 110 places in 316 ms of which 3 ms to minimize.
[2024-05-23 09:14:04] [INFO ] Deduced a trap composed of 107 places in 325 ms of which 3 ms to minimize.
[2024-05-23 09:14:04] [INFO ] Deduced a trap composed of 92 places in 320 ms of which 3 ms to minimize.
[2024-05-23 09:14:04] [INFO ] Deduced a trap composed of 99 places in 232 ms of which 3 ms to minimize.
[2024-05-23 09:14:04] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 4 ms to minimize.
[2024-05-23 09:14:05] [INFO ] Deduced a trap composed of 90 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:14:05] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:14:05] [INFO ] Deduced a trap composed of 127 places in 246 ms of which 4 ms to minimize.
[2024-05-23 09:14:05] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 3 ms to minimize.
[2024-05-23 09:14:06] [INFO ] Deduced a trap composed of 114 places in 316 ms of which 5 ms to minimize.
[2024-05-23 09:14:06] [INFO ] Deduced a trap composed of 58 places in 343 ms of which 4 ms to minimize.
[2024-05-23 09:14:06] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 4 ms to minimize.
[2024-05-23 09:14:07] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-23 09:14:10] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 3 ms to minimize.
[2024-05-23 09:14:10] [INFO ] Deduced a trap composed of 97 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:14:10] [INFO ] Deduced a trap composed of 81 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:14:10] [INFO ] Deduced a trap composed of 82 places in 246 ms of which 3 ms to minimize.
[2024-05-23 09:14:11] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 3 ms to minimize.
[2024-05-23 09:14:11] [INFO ] Deduced a trap composed of 75 places in 238 ms of which 3 ms to minimize.
[2024-05-23 09:14:11] [INFO ] Deduced a trap composed of 77 places in 233 ms of which 3 ms to minimize.
[2024-05-23 09:14:12] [INFO ] Deduced a trap composed of 83 places in 311 ms of which 3 ms to minimize.
[2024-05-23 09:14:12] [INFO ] Deduced a trap composed of 75 places in 258 ms of which 3 ms to minimize.
[2024-05-23 09:14:12] [INFO ] Deduced a trap composed of 102 places in 243 ms of which 3 ms to minimize.
[2024-05-23 09:14:12] [INFO ] Deduced a trap composed of 92 places in 249 ms of which 3 ms to minimize.
[2024-05-23 09:14:13] [INFO ] Deduced a trap composed of 101 places in 320 ms of which 4 ms to minimize.
[2024-05-23 09:14:13] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:14:13] [INFO ] Deduced a trap composed of 86 places in 322 ms of which 5 ms to minimize.
[2024-05-23 09:14:14] [INFO ] Deduced a trap composed of 65 places in 311 ms of which 6 ms to minimize.
[2024-05-23 09:14:14] [INFO ] Deduced a trap composed of 102 places in 319 ms of which 5 ms to minimize.
[2024-05-23 09:14:14] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 2 ms to minimize.
[2024-05-23 09:14:14] [INFO ] Deduced a trap composed of 125 places in 310 ms of which 4 ms to minimize.
[2024-05-23 09:14:15] [INFO ] Deduced a trap composed of 105 places in 186 ms of which 2 ms to minimize.
[2024-05-23 09:14:15] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-23 09:14:22] [INFO ] Deduced a trap composed of 132 places in 257 ms of which 5 ms to minimize.
[2024-05-23 09:14:22] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 3 ms to minimize.
[2024-05-23 09:14:22] [INFO ] Deduced a trap composed of 94 places in 373 ms of which 5 ms to minimize.
[2024-05-23 09:14:23] [INFO ] Deduced a trap composed of 96 places in 337 ms of which 5 ms to minimize.
[2024-05-23 09:14:23] [INFO ] Deduced a trap composed of 101 places in 388 ms of which 5 ms to minimize.
[2024-05-23 09:14:23] [INFO ] Deduced a trap composed of 128 places in 386 ms of which 5 ms to minimize.
[2024-05-23 09:14:24] [INFO ] Deduced a trap composed of 115 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:14:24] [INFO ] Deduced a trap composed of 94 places in 237 ms of which 3 ms to minimize.
[2024-05-23 09:14:24] [INFO ] Deduced a trap composed of 99 places in 241 ms of which 3 ms to minimize.
[2024-05-23 09:14:25] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 3 ms to minimize.
[2024-05-23 09:14:25] [INFO ] Deduced a trap composed of 98 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/913 variables, and 75 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 51/75 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/913 variables, and 75 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/604 constraints, Known Traps: 51/51 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62349 ms. Remains : 298/298 places, 615/615 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 494
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 494
Applied a total of 242 rules in 13 ms. Remains 177 /298 variables (removed 121) and now considering 494/615 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 177 cols
[2024-05-23 09:14:55] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 09:14:55] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-23 09:14:55] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2024-05-23 09:14:55] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 09:14:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 09:14:55] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2024-05-23 09:14:55] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 09:14:55] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 09:14:55] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 551 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Applied a total of 0 rules in 13 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 529 cols
[2024-05-23 09:14:56] [INFO ] Computed 24 invariants in 5 ms
[2024-05-23 09:14:56] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-23 09:14:56] [INFO ] Invariant cache hit.
[2024-05-23 09:14:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:15:01] [INFO ] Implicit Places using invariants and state equation in 4956 ms returned []
Implicit Place search using SMT with State Equation took 5533 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2024-05-23 09:15:01] [INFO ] Invariant cache hit.
[2024-05-23 09:15:01] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:15:15] [INFO ] Deduced a trap composed of 278 places in 493 ms of which 6 ms to minimize.
[2024-05-23 09:15:16] [INFO ] Deduced a trap composed of 243 places in 463 ms of which 5 ms to minimize.
[2024-05-23 09:15:17] [INFO ] Deduced a trap composed of 168 places in 516 ms of which 6 ms to minimize.
[2024-05-23 09:15:18] [INFO ] Deduced a trap composed of 147 places in 487 ms of which 5 ms to minimize.
[2024-05-23 09:15:18] [INFO ] Deduced a trap composed of 193 places in 460 ms of which 6 ms to minimize.
[2024-05-23 09:15:19] [INFO ] Deduced a trap composed of 123 places in 426 ms of which 5 ms to minimize.
[2024-05-23 09:15:19] [INFO ] Deduced a trap composed of 312 places in 484 ms of which 5 ms to minimize.
[2024-05-23 09:15:20] [INFO ] Deduced a trap composed of 221 places in 496 ms of which 5 ms to minimize.
[2024-05-23 09:15:20] [INFO ] Deduced a trap composed of 202 places in 450 ms of which 6 ms to minimize.
[2024-05-23 09:15:21] [INFO ] Deduced a trap composed of 116 places in 480 ms of which 5 ms to minimize.
[2024-05-23 09:15:21] [INFO ] Deduced a trap composed of 169 places in 471 ms of which 5 ms to minimize.
[2024-05-23 09:15:22] [INFO ] Deduced a trap composed of 106 places in 579 ms of which 5 ms to minimize.
[2024-05-23 09:15:22] [INFO ] Deduced a trap composed of 156 places in 458 ms of which 6 ms to minimize.
[2024-05-23 09:15:23] [INFO ] Deduced a trap composed of 138 places in 477 ms of which 7 ms to minimize.
[2024-05-23 09:15:23] [INFO ] Deduced a trap composed of 102 places in 519 ms of which 5 ms to minimize.
[2024-05-23 09:15:24] [INFO ] Deduced a trap composed of 311 places in 455 ms of which 5 ms to minimize.
[2024-05-23 09:15:25] [INFO ] Deduced a trap composed of 161 places in 391 ms of which 5 ms to minimize.
[2024-05-23 09:15:25] [INFO ] Deduced a trap composed of 211 places in 488 ms of which 5 ms to minimize.
[2024-05-23 09:15:26] [INFO ] Deduced a trap composed of 354 places in 500 ms of which 5 ms to minimize.
[2024-05-23 09:15:26] [INFO ] Deduced a trap composed of 274 places in 471 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:15:32] [INFO ] Deduced a trap composed of 155 places in 464 ms of which 6 ms to minimize.
SMT process timed out in 30855ms, After SMT, problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 30864ms
Finished structural reductions in LTL mode , in 1 iterations and 36412 ms. Remains : 529/529 places, 846/846 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 756996 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 756996 steps, saw 579646 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-23 09:15:35] [INFO ] Invariant cache hit.
[2024-05-23 09:15:35] [INFO ] State equation strengthened by 110 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) 495/497 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/518 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1375 variables, 529/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1375 variables, 110/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1375 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1375 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1375/1375 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 529/529 constraints, ReadFeed: 110/110 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) 495/497 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/518 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1375 variables, 529/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1375 variables, 110/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1375 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1375 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1375 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1375/1375 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 529/529 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 846/846 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 726
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 409 transition count 726
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 409 transition count 616
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 298 transition count 615
Applied a total of 462 rules in 36 ms. Remains 298 /529 variables (removed 231) and now considering 615/846 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 298/529 places, 615/846 transitions.
RANDOM walk for 40000 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 838971 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 838971 steps, saw 631790 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2024-05-23 09:15:40] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 09:15:40] [INFO ] State equation strengthened by 110 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) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 09:15:41] [INFO ] Deduced a trap composed of 90 places in 248 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 615/913 variables, 298/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 615/913 variables, 298/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/913 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/913 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1345ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 298/298 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-05-23 09:15:42] [INFO ] Invariant cache hit.
[2024-05-23 09:15:42] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-23 09:15:42] [INFO ] Invariant cache hit.
[2024-05-23 09:15:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:15:43] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-05-23 09:15:43] [INFO ] Redundant transitions in 4 ms returned []
Running 604 sub problems to find dead transitions.
[2024-05-23 09:15:43] [INFO ] Invariant cache hit.
[2024-05-23 09:15:43] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-23 09:15:51] [INFO ] Deduced a trap composed of 109 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:15:51] [INFO ] Deduced a trap composed of 77 places in 240 ms of which 3 ms to minimize.
[2024-05-23 09:15:51] [INFO ] Deduced a trap composed of 102 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:15:52] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:15:52] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 4 ms to minimize.
[2024-05-23 09:15:52] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:15:52] [INFO ] Deduced a trap composed of 103 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:15:53] [INFO ] Deduced a trap composed of 110 places in 267 ms of which 4 ms to minimize.
[2024-05-23 09:15:53] [INFO ] Deduced a trap composed of 107 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:15:53] [INFO ] Deduced a trap composed of 92 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:15:54] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 3 ms to minimize.
[2024-05-23 09:15:54] [INFO ] Deduced a trap composed of 73 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:15:54] [INFO ] Deduced a trap composed of 90 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:15:54] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:15:55] [INFO ] Deduced a trap composed of 127 places in 215 ms of which 4 ms to minimize.
[2024-05-23 09:15:55] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:15:55] [INFO ] Deduced a trap composed of 114 places in 245 ms of which 3 ms to minimize.
[2024-05-23 09:15:55] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 3 ms to minimize.
[2024-05-23 09:15:56] [INFO ] Deduced a trap composed of 52 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:15:56] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-23 09:15:59] [INFO ] Deduced a trap composed of 98 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:15:59] [INFO ] Deduced a trap composed of 97 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:15:59] [INFO ] Deduced a trap composed of 81 places in 259 ms of which 4 ms to minimize.
[2024-05-23 09:15:59] [INFO ] Deduced a trap composed of 82 places in 261 ms of which 4 ms to minimize.
[2024-05-23 09:16:00] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 3 ms to minimize.
[2024-05-23 09:16:00] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:16:00] [INFO ] Deduced a trap composed of 77 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:16:00] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:16:01] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 3 ms to minimize.
[2024-05-23 09:16:01] [INFO ] Deduced a trap composed of 102 places in 229 ms of which 3 ms to minimize.
[2024-05-23 09:16:01] [INFO ] Deduced a trap composed of 92 places in 244 ms of which 3 ms to minimize.
[2024-05-23 09:16:01] [INFO ] Deduced a trap composed of 101 places in 250 ms of which 4 ms to minimize.
[2024-05-23 09:16:02] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 3 ms to minimize.
[2024-05-23 09:16:02] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:16:02] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:16:02] [INFO ] Deduced a trap composed of 102 places in 238 ms of which 3 ms to minimize.
[2024-05-23 09:16:03] [INFO ] Deduced a trap composed of 82 places in 246 ms of which 3 ms to minimize.
[2024-05-23 09:16:03] [INFO ] Deduced a trap composed of 125 places in 244 ms of which 3 ms to minimize.
[2024-05-23 09:16:03] [INFO ] Deduced a trap composed of 105 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:16:03] [INFO ] Deduced a trap composed of 84 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-23 09:16:11] [INFO ] Deduced a trap composed of 132 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:16:11] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:16:11] [INFO ] Deduced a trap composed of 94 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:16:11] [INFO ] Deduced a trap composed of 96 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:16:12] [INFO ] Deduced a trap composed of 101 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:16:12] [INFO ] Deduced a trap composed of 128 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:16:12] [INFO ] Deduced a trap composed of 115 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:16:12] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:16:13] [INFO ] Deduced a trap composed of 99 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:16:13] [INFO ] Deduced a trap composed of 113 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:16:13] [INFO ] Deduced a trap composed of 98 places in 262 ms of which 4 ms to minimize.
[2024-05-23 09:16:14] [INFO ] Deduced a trap composed of 48 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:16:14] [INFO ] Deduced a trap composed of 77 places in 243 ms of which 3 ms to minimize.
SMT process timed out in 30615ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 30621ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32454 ms. Remains : 298/298 places, 615/615 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 494
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 494
Applied a total of 242 rules in 10 ms. Remains 177 /298 variables (removed 121) and now considering 494/615 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 177 cols
[2024-05-23 09:16:14] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 09:16:14] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 09:16:14] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 15 ms returned sat
[2024-05-23 09:16:14] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 09:16:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 09:16:14] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 13 ms returned sat
[2024-05-23 09:16:14] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 09:16:14] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 09:16:15] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 504 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 846
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 120 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 230 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Applied a total of 230 rules in 33 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-23 09:16:16] [INFO ] Redundant transitions in 8 ms returned []
Running 835 sub problems to find dead transitions.
// Phase 1: matrix 846 rows 529 cols
[2024-05-23 09:16:16] [INFO ] Computed 24 invariants in 10 ms
[2024-05-23 09:16:16] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:16:26] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 3 ms to minimize.
[2024-05-23 09:16:26] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-23 09:16:26] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-23 09:16:26] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-23 09:16:27] [INFO ] Deduced a trap composed of 24 places in 397 ms of which 5 ms to minimize.
[2024-05-23 09:16:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-23 09:16:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-23 09:16:28] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 5 ms to minimize.
[2024-05-23 09:16:28] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-23 09:16:28] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-23 09:16:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-23 09:16:30] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-23 09:16:31] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 5 ms to minimize.
[2024-05-23 09:16:32] [INFO ] Deduced a trap composed of 64 places in 439 ms of which 5 ms to minimize.
[2024-05-23 09:16:32] [INFO ] Deduced a trap composed of 55 places in 431 ms of which 6 ms to minimize.
[2024-05-23 09:16:33] [INFO ] Deduced a trap composed of 120 places in 405 ms of which 5 ms to minimize.
[2024-05-23 09:16:33] [INFO ] Deduced a trap composed of 111 places in 462 ms of which 5 ms to minimize.
[2024-05-23 09:16:34] [INFO ] Deduced a trap composed of 113 places in 447 ms of which 5 ms to minimize.
[2024-05-23 09:16:34] [INFO ] Deduced a trap composed of 91 places in 428 ms of which 5 ms to minimize.
[2024-05-23 09:16:34] [INFO ] Deduced a trap composed of 116 places in 429 ms of which 5 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/44 constraints. Problems are: Problem set: 230 solved, 605 unsolved
[2024-05-23 09:16:39] [INFO ] Deduced a trap composed of 120 places in 360 ms of which 5 ms to minimize.
[2024-05-23 09:16:39] [INFO ] Deduced a trap composed of 112 places in 439 ms of which 6 ms to minimize.
[2024-05-23 09:16:39] [INFO ] Deduced a trap composed of 92 places in 321 ms of which 5 ms to minimize.
[2024-05-23 09:16:40] [INFO ] Deduced a trap composed of 116 places in 435 ms of which 5 ms to minimize.
[2024-05-23 09:16:40] [INFO ] Deduced a trap composed of 132 places in 429 ms of which 6 ms to minimize.
[2024-05-23 09:16:41] [INFO ] Deduced a trap composed of 124 places in 428 ms of which 5 ms to minimize.
[2024-05-23 09:16:41] [INFO ] Deduced a trap composed of 64 places in 428 ms of which 6 ms to minimize.
[2024-05-23 09:16:42] [INFO ] Deduced a trap composed of 120 places in 422 ms of which 5 ms to minimize.
[2024-05-23 09:16:42] [INFO ] Deduced a trap composed of 103 places in 425 ms of which 5 ms to minimize.
[2024-05-23 09:16:43] [INFO ] Deduced a trap composed of 66 places in 421 ms of which 5 ms to minimize.
[2024-05-23 09:16:43] [INFO ] Deduced a trap composed of 116 places in 443 ms of which 5 ms to minimize.
[2024-05-23 09:16:44] [INFO ] Deduced a trap composed of 88 places in 438 ms of which 5 ms to minimize.
[2024-05-23 09:16:44] [INFO ] Deduced a trap composed of 98 places in 438 ms of which 5 ms to minimize.
[2024-05-23 09:16:45] [INFO ] Deduced a trap composed of 72 places in 440 ms of which 5 ms to minimize.
[2024-05-23 09:16:45] [INFO ] Deduced a trap composed of 75 places in 441 ms of which 5 ms to minimize.
[2024-05-23 09:16:46] [INFO ] Deduced a trap composed of 109 places in 438 ms of which 6 ms to minimize.
[2024-05-23 09:16:46] [INFO ] Deduced a trap composed of 89 places in 425 ms of which 5 ms to minimize.
[2024-05-23 09:16:46] [INFO ] Deduced a trap composed of 91 places in 318 ms of which 5 ms to minimize.
SMT process timed out in 30878ms, After SMT, problems are : Problem set: 230 solved, 605 unsolved
Search for dead transitions found 230 dead transitions in 30888ms
Found 230 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 230 transitions
Dead transitions reduction (with SMT) removed 230 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 529/529 places, 616/846 transitions.
Graph (complete) has 1649 edges and 529 vertex of which 299 are kept as prefixes of interest. Removing 230 places using SCC suffix rule.1 ms
Discarding 230 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 299 /529 variables (removed 230) and now considering 616/616 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/529 places, 616/846 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30948 ms. Remains : 299/529 places, 616/846 transitions.
Built C files in :
/tmp/ltsmin7263364151307821167
[2024-05-23 09:16:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7263364151307821167
Running compilation step : cd /tmp/ltsmin7263364151307821167;'/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 2775 ms.
Running link step : cd /tmp/ltsmin7263364151307821167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7263364151307821167;'/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/stateBased15590714559907546932.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Applied a total of 0 rules in 12 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 529 cols
[2024-05-23 09:17:02] [INFO ] Computed 24 invariants in 8 ms
[2024-05-23 09:17:02] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-23 09:17:02] [INFO ] Invariant cache hit.
[2024-05-23 09:17:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:17:07] [INFO ] Implicit Places using invariants and state equation in 5010 ms returned []
Implicit Place search using SMT with State Equation took 5639 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2024-05-23 09:17:07] [INFO ] Invariant cache hit.
[2024-05-23 09:17:07] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:17:21] [INFO ] Deduced a trap composed of 278 places in 461 ms of which 5 ms to minimize.
[2024-05-23 09:17:22] [INFO ] Deduced a trap composed of 243 places in 455 ms of which 6 ms to minimize.
[2024-05-23 09:17:23] [INFO ] Deduced a trap composed of 168 places in 461 ms of which 5 ms to minimize.
[2024-05-23 09:17:23] [INFO ] Deduced a trap composed of 147 places in 451 ms of which 5 ms to minimize.
[2024-05-23 09:17:24] [INFO ] Deduced a trap composed of 193 places in 455 ms of which 5 ms to minimize.
[2024-05-23 09:17:24] [INFO ] Deduced a trap composed of 123 places in 487 ms of which 5 ms to minimize.
[2024-05-23 09:17:25] [INFO ] Deduced a trap composed of 312 places in 456 ms of which 6 ms to minimize.
[2024-05-23 09:17:26] [INFO ] Deduced a trap composed of 221 places in 445 ms of which 5 ms to minimize.
[2024-05-23 09:17:26] [INFO ] Deduced a trap composed of 202 places in 491 ms of which 5 ms to minimize.
[2024-05-23 09:17:27] [INFO ] Deduced a trap composed of 116 places in 404 ms of which 5 ms to minimize.
[2024-05-23 09:17:27] [INFO ] Deduced a trap composed of 169 places in 472 ms of which 5 ms to minimize.
[2024-05-23 09:17:28] [INFO ] Deduced a trap composed of 106 places in 448 ms of which 5 ms to minimize.
[2024-05-23 09:17:28] [INFO ] Deduced a trap composed of 156 places in 454 ms of which 5 ms to minimize.
[2024-05-23 09:17:29] [INFO ] Deduced a trap composed of 138 places in 489 ms of which 5 ms to minimize.
[2024-05-23 09:17:29] [INFO ] Deduced a trap composed of 102 places in 444 ms of which 5 ms to minimize.
[2024-05-23 09:17:30] [INFO ] Deduced a trap composed of 311 places in 468 ms of which 5 ms to minimize.
[2024-05-23 09:17:30] [INFO ] Deduced a trap composed of 161 places in 522 ms of which 5 ms to minimize.
[2024-05-23 09:17:31] [INFO ] Deduced a trap composed of 211 places in 347 ms of which 5 ms to minimize.
[2024-05-23 09:17:31] [INFO ] Deduced a trap composed of 354 places in 468 ms of which 5 ms to minimize.
[2024-05-23 09:17:32] [INFO ] Deduced a trap composed of 274 places in 441 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 835 unsolved
[2024-05-23 09:17:38] [INFO ] Deduced a trap composed of 155 places in 433 ms of which 6 ms to minimize.
[2024-05-23 09:17:38] [INFO ] Deduced a trap composed of 150 places in 483 ms of which 5 ms to minimize.
SMT process timed out in 30822ms, After SMT, problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 30832ms
Finished structural reductions in LTL mode , in 1 iterations and 36484 ms. Remains : 529/529 places, 846/846 transitions.
Built C files in :
/tmp/ltsmin838688973658227279
[2024-05-23 09:17:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin838688973658227279
Running compilation step : cd /tmp/ltsmin838688973658227279;'/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 2792 ms.
Running link step : cd /tmp/ltsmin838688973658227279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin838688973658227279;'/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/stateBased2774291642786380619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 09:17:53] [INFO ] Flatten gal took : 32 ms
[2024-05-23 09:17:53] [INFO ] Flatten gal took : 30 ms
[2024-05-23 09:17:53] [INFO ] Time to serialize gal into /tmp/LTL14020614645950384191.gal : 6 ms
[2024-05-23 09:17:53] [INFO ] Time to serialize properties into /tmp/LTL16271057593919074999.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14020614645950384191.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12737189174056673989.hoa' '-atoms' '/tmp/LTL16271057593919074999.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...320
Loading property file /tmp/LTL16271057593919074999.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12737189174056673989.hoa
Detected timeout of ITS tools.
[2024-05-23 09:18:08] [INFO ] Flatten gal took : 28 ms
[2024-05-23 09:18:08] [INFO ] Flatten gal took : 28 ms
[2024-05-23 09:18:08] [INFO ] Time to serialize gal into /tmp/LTL11368369918716170929.gal : 6 ms
[2024-05-23 09:18:08] [INFO ] Time to serialize properties into /tmp/LTL7169982091811944091.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/LTL11368369918716170929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7169982091811944091.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 : !((X(X(G("((next_15!=1)||(ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((next_15!=1)||(ncs_10_8!=1))"
Detected timeout of ITS tools.
[2024-05-23 09:18:24] [INFO ] Flatten gal took : 29 ms
[2024-05-23 09:18:24] [INFO ] Applying decomposition
[2024-05-23 09:18:24] [INFO ] Flatten gal took : 27 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/graph11426853970500109764.txt' '-o' '/tmp/graph11426853970500109764.bin' '-w' '/tmp/graph11426853970500109764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11426853970500109764.bin' '-l' '-1' '-v' '-w' '/tmp/graph11426853970500109764.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:18:24] [INFO ] Decomposing Gal with order
[2024-05-23 09:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:18:24] [INFO ] Removed a total of 1422 redundant transitions.
[2024-05-23 09:18:24] [INFO ] Flatten gal took : 68 ms
[2024-05-23 09:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 23 ms.
[2024-05-23 09:18:24] [INFO ] Time to serialize gal into /tmp/LTL3947561505897383712.gal : 12 ms
[2024-05-23 09:18:24] [INFO ] Time to serialize properties into /tmp/LTL11297641677788463746.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/LTL3947561505897383712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11297641677788463746.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 : !((X(X(G("((i0.i1.u7.next_15!=1)||(i1.u145.ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((i0.i1.u7.next_15!=1)||(i1.u145.ncs_10_8!=1))"
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 297825 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 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 235 place count 421 transition count 757
Iterating global reduction 0 with 15 rules applied. Total rules applied 250 place count 421 transition count 757
Applied a total of 250 rules in 37 ms. Remains 421 /546 variables (removed 125) and now considering 757/1182 (removed 425) transitions.
// Phase 1: matrix 757 rows 421 cols
[2024-05-23 09:18:39] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 09:18:40] [INFO ] Implicit Places using invariants in 916 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 918 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/546 places, 757/1182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 14 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2024-05-23 09:18:40] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 09:18:40] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-23 09:18:40] [INFO ] Invariant cache hit.
[2024-05-23 09:18:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:18:42] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/546 places, 638/1182 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3047 ms. Remains : 301/546 places, 638/1182 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 104 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))]
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 32520 steps (6 resets) in 348 ms. (93 steps per ms) remains 0/2 properties
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 (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 9 factoid took 228 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 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-05-23 09:18:43] [INFO ] Invariant cache hit.
[2024-05-23 09:18:44] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-23 09:18:44] [INFO ] Invariant cache hit.
[2024-05-23 09:18:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:18:45] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
[2024-05-23 09:18:45] [INFO ] Redundant transitions in 5 ms returned []
Running 627 sub problems to find dead transitions.
[2024-05-23 09:18:45] [INFO ] Invariant cache hit.
[2024-05-23 09:18:45] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:18:53] [INFO ] Deduced a trap composed of 87 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:18:54] [INFO ] Deduced a trap composed of 109 places in 232 ms of which 3 ms to minimize.
[2024-05-23 09:18:54] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:18:54] [INFO ] Deduced a trap composed of 85 places in 249 ms of which 4 ms to minimize.
[2024-05-23 09:18:54] [INFO ] Deduced a trap composed of 95 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:18:55] [INFO ] Deduced a trap composed of 88 places in 282 ms of which 3 ms to minimize.
[2024-05-23 09:18:55] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:18:55] [INFO ] Deduced a trap composed of 107 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:18:56] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:18:56] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:18:56] [INFO ] Deduced a trap composed of 86 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:18:56] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 4 ms to minimize.
[2024-05-23 09:18:57] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:18:57] [INFO ] Deduced a trap composed of 88 places in 262 ms of which 4 ms to minimize.
[2024-05-23 09:18:57] [INFO ] Deduced a trap composed of 78 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:18:58] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 4 ms to minimize.
[2024-05-23 09:18:58] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 3 ms to minimize.
[2024-05-23 09:18:58] [INFO ] Deduced a trap composed of 117 places in 253 ms of which 3 ms to minimize.
[2024-05-23 09:18:58] [INFO ] Deduced a trap composed of 90 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:18:59] [INFO ] Deduced a trap composed of 57 places in 254 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:19:00] [INFO ] Deduced a trap composed of 124 places in 281 ms of which 4 ms to minimize.
[2024-05-23 09:19:00] [INFO ] Deduced a trap composed of 99 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:19:00] [INFO ] Deduced a trap composed of 103 places in 255 ms of which 4 ms to minimize.
[2024-05-23 09:19:01] [INFO ] Deduced a trap composed of 105 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:19:03] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:19:03] [INFO ] Deduced a trap composed of 84 places in 250 ms of which 3 ms to minimize.
[2024-05-23 09:19:03] [INFO ] Deduced a trap composed of 92 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:19:04] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 3 ms to minimize.
[2024-05-23 09:19:04] [INFO ] Deduced a trap composed of 56 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:19:04] [INFO ] Deduced a trap composed of 81 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:19:04] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 4 ms to minimize.
[2024-05-23 09:19:05] [INFO ] Deduced a trap composed of 97 places in 273 ms of which 4 ms to minimize.
[2024-05-23 09:19:05] [INFO ] Deduced a trap composed of 132 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:19:05] [INFO ] Deduced a trap composed of 142 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:19:06] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:19:06] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:19:06] [INFO ] Deduced a trap composed of 70 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:19:07] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 3 ms to minimize.
[2024-05-23 09:19:07] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:19:07] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:19:13] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 3 ms to minimize.
[2024-05-23 09:19:13] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:19:16] [INFO ] Deduced a trap composed of 122 places in 282 ms of which 3 ms to minimize.
SMT process timed out in 30514ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32524 ms. Remains : 301/301 places, 638/638 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT 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 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 929 ms. (43 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 14439 steps (3 resets) in 39 ms. (360 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 9 factoid took 231 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 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 222 ms.
Built C files in :
/tmp/ltsmin8872894260781321610
[2024-05-23 09:19:17] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2024-05-23 09:19:17] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:19:17] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2024-05-23 09:19:17] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:19:18] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2024-05-23 09:19:18] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:19:18] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8872894260781321610
Running compilation step : cd /tmp/ltsmin8872894260781321610;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8872894260781321610;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8872894260781321610;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-05-23 09:19:21] [INFO ] Invariant cache hit.
[2024-05-23 09:19:21] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-23 09:19:21] [INFO ] Invariant cache hit.
[2024-05-23 09:19:21] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:19:23] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2024-05-23 09:19:23] [INFO ] Redundant transitions in 4 ms returned []
Running 627 sub problems to find dead transitions.
[2024-05-23 09:19:23] [INFO ] Invariant cache hit.
[2024-05-23 09:19:23] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:19:30] [INFO ] Deduced a trap composed of 87 places in 274 ms of which 3 ms to minimize.
[2024-05-23 09:19:31] [INFO ] Deduced a trap composed of 109 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:19:31] [INFO ] Deduced a trap composed of 83 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:19:31] [INFO ] Deduced a trap composed of 85 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:19:31] [INFO ] Deduced a trap composed of 95 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:19:32] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 3 ms to minimize.
[2024-05-23 09:19:32] [INFO ] Deduced a trap composed of 88 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:19:32] [INFO ] Deduced a trap composed of 107 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:19:33] [INFO ] Deduced a trap composed of 53 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:19:33] [INFO ] Deduced a trap composed of 56 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:19:33] [INFO ] Deduced a trap composed of 86 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:19:33] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:19:34] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 3 ms to minimize.
[2024-05-23 09:19:34] [INFO ] Deduced a trap composed of 88 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:19:34] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:19:34] [INFO ] Deduced a trap composed of 89 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:19:35] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:19:35] [INFO ] Deduced a trap composed of 117 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:19:35] [INFO ] Deduced a trap composed of 90 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:19:36] [INFO ] Deduced a trap composed of 57 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:19:37] [INFO ] Deduced a trap composed of 124 places in 281 ms of which 3 ms to minimize.
[2024-05-23 09:19:37] [INFO ] Deduced a trap composed of 99 places in 268 ms of which 4 ms to minimize.
[2024-05-23 09:19:37] [INFO ] Deduced a trap composed of 103 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:19:38] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:19:40] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 3 ms to minimize.
[2024-05-23 09:19:40] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 4 ms to minimize.
[2024-05-23 09:19:40] [INFO ] Deduced a trap composed of 92 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:19:41] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:19:41] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:19:41] [INFO ] Deduced a trap composed of 81 places in 272 ms of which 4 ms to minimize.
[2024-05-23 09:19:41] [INFO ] Deduced a trap composed of 73 places in 301 ms of which 3 ms to minimize.
[2024-05-23 09:19:42] [INFO ] Deduced a trap composed of 97 places in 260 ms of which 4 ms to minimize.
[2024-05-23 09:19:42] [INFO ] Deduced a trap composed of 132 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:19:42] [INFO ] Deduced a trap composed of 142 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:19:43] [INFO ] Deduced a trap composed of 72 places in 255 ms of which 4 ms to minimize.
[2024-05-23 09:19:43] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:19:43] [INFO ] Deduced a trap composed of 70 places in 242 ms of which 3 ms to minimize.
[2024-05-23 09:19:43] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 3 ms to minimize.
[2024-05-23 09:19:44] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:19:44] [INFO ] Deduced a trap composed of 76 places in 261 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:19:50] [INFO ] Deduced a trap composed of 73 places in 274 ms of which 3 ms to minimize.
[2024-05-23 09:19:50] [INFO ] Deduced a trap composed of 63 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:19:53] [INFO ] Deduced a trap composed of 122 places in 286 ms of which 3 ms to minimize.
[2024-05-23 09:19:53] [INFO ] Deduced a trap composed of 123 places in 277 ms of which 4 ms to minimize.
[2024-05-23 09:19:53] [INFO ] Deduced a trap composed of 123 places in 272 ms of which 3 ms to minimize.
SMT process timed out in 30646ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32783 ms. Remains : 301/301 places, 638/638 transitions.
Built C files in :
/tmp/ltsmin16100730608748654058
[2024-05-23 09:19:53] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2024-05-23 09:19:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:19:53] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2024-05-23 09:19:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:19:53] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2024-05-23 09:19:53] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:19:53] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16100730608748654058
Running compilation step : cd /tmp/ltsmin16100730608748654058;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16100730608748654058;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16100730608748654058;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 09:19:57] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:19:57] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:19:57] [INFO ] Time to serialize gal into /tmp/LTL11664466735037671204.gal : 4 ms
[2024-05-23 09:19:57] [INFO ] Time to serialize properties into /tmp/LTL15224896996087078824.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11664466735037671204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13248539876200002096.hoa' '-atoms' '/tmp/LTL15224896996087078824.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...320
Loading property file /tmp/LTL15224896996087078824.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13248539876200002096.hoa
Detected timeout of ITS tools.
[2024-05-23 09:20:12] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:20:12] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:20:12] [INFO ] Time to serialize gal into /tmp/LTL13296057598166136708.gal : 6 ms
[2024-05-23 09:20:12] [INFO ] Time to serialize properties into /tmp/LTL15287522285538331043.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/LTL13296057598166136708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15287522285538331043.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((next_17==1)&&(ncs_0_5==1))"))U((G(!("((next_17==1)&&(ncs_0_5==1))")))||("((!((next_6==1)&&(ncs_10_5==1)))&&(!((next_17==1...180
Formula 0 simplified : FG("((next_17==1)&&(ncs_0_5==1))" M !"((!((next_6==1)&&(ncs_10_5==1)))&&(!((next_17==1)&&(ncs_0_5==1))))")
Detected timeout of ITS tools.
[2024-05-23 09:20:27] [INFO ] Flatten gal took : 18 ms
[2024-05-23 09:20:27] [INFO ] Applying decomposition
[2024-05-23 09:20:27] [INFO ] Flatten gal took : 18 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/graph6296697693444704573.txt' '-o' '/tmp/graph6296697693444704573.bin' '-w' '/tmp/graph6296697693444704573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6296697693444704573.bin' '-l' '-1' '-v' '-w' '/tmp/graph6296697693444704573.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:20:27] [INFO ] Decomposing Gal with order
[2024-05-23 09:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:20:27] [INFO ] Removed a total of 1136 redundant transitions.
[2024-05-23 09:20:27] [INFO ] Flatten gal took : 49 ms
[2024-05-23 09:20:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 22 ms.
[2024-05-23 09:20:27] [INFO ] Time to serialize gal into /tmp/LTL10290556012343002342.gal : 9 ms
[2024-05-23 09:20:27] [INFO ] Time to serialize properties into /tmp/LTL3192766073370762764.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/LTL10290556012343002342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3192766073370762764.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((!("((i4.i0.u11.next_17==1)&&(i0.u42.ncs_0_5==1))"))U((G(!("((i4.i0.u11.next_17==1)&&(i0.u42.ncs_0_5==1))")))||("((!((i4.i0.u7....244
Formula 0 simplified : FG("((i4.i0.u11.next_17==1)&&(i0.u42.ncs_0_5==1))" M !"((!((i4.i0.u7.next_6==1)&&(u59.ncs_10_5==1)))&&(!((i4.i0.u11.next_17==1)&&(i0...176
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 123016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 236 place count 420 transition count 736
Iterating global reduction 0 with 16 rules applied. Total rules applied 252 place count 420 transition count 736
Applied a total of 252 rules in 41 ms. Remains 420 /546 variables (removed 126) and now considering 736/1182 (removed 446) transitions.
// Phase 1: matrix 736 rows 420 cols
[2024-05-23 09:20:42] [INFO ] Computed 25 invariants in 7 ms
[2024-05-23 09:20:43] [INFO ] Implicit Places using invariants in 939 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 941 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/546 places, 736/1182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 19 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2024-05-23 09:20:43] [INFO ] Computed 24 invariants in 6 ms
[2024-05-23 09:20:44] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-23 09:20:44] [INFO ] Invariant cache hit.
[2024-05-23 09:20:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:20:45] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/546 places, 616/1182 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2968 ms. Remains : 299/546 places, 616/1182 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 113513 steps, run visited all 1 properties in 364 ms. (steps per millisecond=311 )
Probabilistic random walk after 113513 steps, saw 88639 distinct states, run finished after 364 ms. (steps per millisecond=311 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-12 finished in 4146 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 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 235 place count 421 transition count 757
Iterating global reduction 0 with 15 rules applied. Total rules applied 250 place count 421 transition count 757
Applied a total of 250 rules in 34 ms. Remains 421 /546 variables (removed 125) and now considering 757/1182 (removed 425) transitions.
// Phase 1: matrix 757 rows 421 cols
[2024-05-23 09:20:46] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 09:20:47] [INFO ] Implicit Places using invariants in 926 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 927 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/546 places, 757/1182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 13 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2024-05-23 09:20:47] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 09:20:48] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-23 09:20:48] [INFO ] Invariant cache hit.
[2024-05-23 09:20:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:20:49] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/546 places, 638/1182 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3145 ms. Remains : 301/546 places, 638/1182 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-15
Product exploration explored 100000 steps with 15 reset in 213 ms.
Product exploration explored 100000 steps with 22 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 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 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-05-23 09:20:50] [INFO ] Invariant cache hit.
[2024-05-23 09:20:50] [INFO ] State equation strengthened by 110 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/939 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/301 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
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)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-05-23 09:20:50] [INFO ] Invariant cache hit.
[2024-05-23 09:20:51] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-23 09:20:51] [INFO ] Invariant cache hit.
[2024-05-23 09:20:51] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:20:53] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
[2024-05-23 09:20:53] [INFO ] Redundant transitions in 5 ms returned []
Running 627 sub problems to find dead transitions.
[2024-05-23 09:20:53] [INFO ] Invariant cache hit.
[2024-05-23 09:20:53] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:21:00] [INFO ] Deduced a trap composed of 75 places in 264 ms of which 4 ms to minimize.
[2024-05-23 09:21:00] [INFO ] Deduced a trap composed of 76 places in 258 ms of which 4 ms to minimize.
[2024-05-23 09:21:01] [INFO ] Deduced a trap composed of 123 places in 275 ms of which 4 ms to minimize.
[2024-05-23 09:21:01] [INFO ] Deduced a trap composed of 112 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:21:02] [INFO ] Deduced a trap composed of 107 places in 214 ms of which 3 ms to minimize.
[2024-05-23 09:21:02] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 4 ms to minimize.
[2024-05-23 09:21:02] [INFO ] Deduced a trap composed of 110 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:21:02] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:21:03] [INFO ] Deduced a trap composed of 138 places in 296 ms of which 3 ms to minimize.
[2024-05-23 09:21:03] [INFO ] Deduced a trap composed of 95 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:21:03] [INFO ] Deduced a trap composed of 91 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:21:04] [INFO ] Deduced a trap composed of 85 places in 277 ms of which 4 ms to minimize.
[2024-05-23 09:21:04] [INFO ] Deduced a trap composed of 79 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:04] [INFO ] Deduced a trap composed of 83 places in 274 ms of which 3 ms to minimize.
[2024-05-23 09:21:04] [INFO ] Deduced a trap composed of 93 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:21:05] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:21:05] [INFO ] Deduced a trap composed of 77 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:21:05] [INFO ] Deduced a trap composed of 92 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:21:06] [INFO ] Deduced a trap composed of 105 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:21:06] [INFO ] Deduced a trap composed of 93 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:21:07] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:21:08] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 3 ms to minimize.
[2024-05-23 09:21:09] [INFO ] Deduced a trap composed of 77 places in 279 ms of which 3 ms to minimize.
[2024-05-23 09:21:10] [INFO ] Deduced a trap composed of 93 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:21:10] [INFO ] Deduced a trap composed of 92 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:21:10] [INFO ] Deduced a trap composed of 104 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:21:11] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:21:11] [INFO ] Deduced a trap composed of 113 places in 201 ms of which 3 ms to minimize.
[2024-05-23 09:21:11] [INFO ] Deduced a trap composed of 101 places in 283 ms of which 3 ms to minimize.
[2024-05-23 09:21:12] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 4 ms to minimize.
[2024-05-23 09:21:12] [INFO ] Deduced a trap composed of 85 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:21:12] [INFO ] Deduced a trap composed of 121 places in 279 ms of which 4 ms to minimize.
[2024-05-23 09:21:12] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 4 ms to minimize.
[2024-05-23 09:21:13] [INFO ] Deduced a trap composed of 104 places in 279 ms of which 3 ms to minimize.
[2024-05-23 09:21:13] [INFO ] Deduced a trap composed of 100 places in 277 ms of which 4 ms to minimize.
[2024-05-23 09:21:13] [INFO ] Deduced a trap composed of 89 places in 283 ms of which 3 ms to minimize.
[2024-05-23 09:21:14] [INFO ] Deduced a trap composed of 75 places in 288 ms of which 4 ms to minimize.
[2024-05-23 09:21:14] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 3 ms to minimize.
[2024-05-23 09:21:15] [INFO ] Deduced a trap composed of 85 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:21:15] [INFO ] Deduced a trap composed of 97 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:21:22] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 3 ms to minimize.
[2024-05-23 09:21:23] [INFO ] Deduced a trap composed of 91 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:21:23] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:21:23] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 3 ms to minimize.
SMT process timed out in 30723ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32977 ms. Remains : 301/301 places, 638/638 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4068 steps (0 resets) in 14 ms. (271 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20 reset in 205 ms.
Product exploration explored 100000 steps with 21 reset in 235 ms.
Built C files in :
/tmp/ltsmin18055806244561933895
[2024-05-23 09:21:24] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2024-05-23 09:21:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:21:24] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2024-05-23 09:21:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:21:24] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2024-05-23 09:21:24] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:21:24] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18055806244561933895
Running compilation step : cd /tmp/ltsmin18055806244561933895;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18055806244561933895;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18055806244561933895;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-05-23 09:21:27] [INFO ] Invariant cache hit.
[2024-05-23 09:21:28] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-23 09:21:28] [INFO ] Invariant cache hit.
[2024-05-23 09:21:28] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:21:30] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
[2024-05-23 09:21:30] [INFO ] Redundant transitions in 4 ms returned []
Running 627 sub problems to find dead transitions.
[2024-05-23 09:21:30] [INFO ] Invariant cache hit.
[2024-05-23 09:21:30] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:21:37] [INFO ] Deduced a trap composed of 75 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:21:37] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:21:38] [INFO ] Deduced a trap composed of 123 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:21:39] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:21:39] [INFO ] Deduced a trap composed of 107 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:39] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:39] [INFO ] Deduced a trap composed of 110 places in 281 ms of which 3 ms to minimize.
[2024-05-23 09:21:40] [INFO ] Deduced a trap composed of 71 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:40] [INFO ] Deduced a trap composed of 138 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:40] [INFO ] Deduced a trap composed of 95 places in 274 ms of which 4 ms to minimize.
[2024-05-23 09:21:41] [INFO ] Deduced a trap composed of 91 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:21:41] [INFO ] Deduced a trap composed of 85 places in 277 ms of which 4 ms to minimize.
[2024-05-23 09:21:41] [INFO ] Deduced a trap composed of 79 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:21:41] [INFO ] Deduced a trap composed of 83 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:21:42] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:42] [INFO ] Deduced a trap composed of 85 places in 280 ms of which 3 ms to minimize.
[2024-05-23 09:21:42] [INFO ] Deduced a trap composed of 77 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:21:43] [INFO ] Deduced a trap composed of 92 places in 283 ms of which 4 ms to minimize.
[2024-05-23 09:21:43] [INFO ] Deduced a trap composed of 105 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:21:43] [INFO ] Deduced a trap composed of 93 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:21:45] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 4 ms to minimize.
[2024-05-23 09:21:45] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:21:47] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:21:47] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 4 ms to minimize.
[2024-05-23 09:21:47] [INFO ] Deduced a trap composed of 92 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:21:48] [INFO ] Deduced a trap composed of 104 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:21:48] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:21:48] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 3 ms to minimize.
[2024-05-23 09:21:49] [INFO ] Deduced a trap composed of 101 places in 249 ms of which 4 ms to minimize.
[2024-05-23 09:21:49] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:21:49] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 3 ms to minimize.
[2024-05-23 09:21:49] [INFO ] Deduced a trap composed of 121 places in 272 ms of which 4 ms to minimize.
[2024-05-23 09:21:50] [INFO ] Deduced a trap composed of 95 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:21:50] [INFO ] Deduced a trap composed of 104 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:21:50] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 3 ms to minimize.
[2024-05-23 09:21:51] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:21:51] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:21:51] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:21:52] [INFO ] Deduced a trap composed of 85 places in 249 ms of which 3 ms to minimize.
[2024-05-23 09:21:52] [INFO ] Deduced a trap composed of 97 places in 436 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-23 09:22:00] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 3 ms to minimize.
[2024-05-23 09:22:00] [INFO ] Deduced a trap composed of 91 places in 268 ms of which 4 ms to minimize.
SMT process timed out in 30599ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30606ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32842 ms. Remains : 301/301 places, 638/638 transitions.
Built C files in :
/tmp/ltsmin15660260570281591455
[2024-05-23 09:22:00] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2024-05-23 09:22:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:22:00] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2024-05-23 09:22:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:22:00] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2024-05-23 09:22:00] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:22:00] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15660260570281591455
Running compilation step : cd /tmp/ltsmin15660260570281591455;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15660260570281591455;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15660260570281591455;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 09:22:04] [INFO ] Flatten gal took : 34 ms
[2024-05-23 09:22:04] [INFO ] Flatten gal took : 21 ms
[2024-05-23 09:22:04] [INFO ] Time to serialize gal into /tmp/LTL3591883813815753410.gal : 22 ms
[2024-05-23 09:22:04] [INFO ] Time to serialize properties into /tmp/LTL6089084701733112611.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/LTL3591883813815753410.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12655041621181292486.hoa' '-atoms' '/tmp/LTL6089084701733112611.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/LTL6089084701733112611.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12655041621181292486.hoa
Detected timeout of ITS tools.
[2024-05-23 09:22:19] [INFO ] Flatten gal took : 18 ms
[2024-05-23 09:22:19] [INFO ] Flatten gal took : 40 ms
[2024-05-23 09:22:19] [INFO ] Time to serialize gal into /tmp/LTL6471427331527669846.gal : 4 ms
[2024-05-23 09:22:19] [INFO ] Time to serialize properties into /tmp/LTL5749582304995810071.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/LTL6471427331527669846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5749582304995810071.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((!("((next_11==1)&&(ncs_3_10==1))"))U((G(!("((next_11==1)&&(ncs_3_10==1))")))||("((!(((next_11==1)&&(ncs_9_3==1))&&((next_11==1...216
Formula 0 simplified : FG("((next_11==1)&&(ncs_3_10==1))" M !"((!(((next_11==1)&&(ncs_9_3==1))&&((next_11==1)&&(ncs_3_10==1))))&&(!((next_11==1)&&(ncs_3_10...164
Detected timeout of ITS tools.
[2024-05-23 09:22:34] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:22:34] [INFO ] Applying decomposition
[2024-05-23 09:22:34] [INFO ] Flatten gal took : 19 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/graph17320154713607491011.txt' '-o' '/tmp/graph17320154713607491011.bin' '-w' '/tmp/graph17320154713607491011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17320154713607491011.bin' '-l' '-1' '-v' '-w' '/tmp/graph17320154713607491011.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:22:34] [INFO ] Decomposing Gal with order
[2024-05-23 09:22:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:22:34] [INFO ] Removed a total of 1132 redundant transitions.
[2024-05-23 09:22:34] [INFO ] Flatten gal took : 47 ms
[2024-05-23 09:22:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 21 ms.
[2024-05-23 09:22:34] [INFO ] Time to serialize gal into /tmp/LTL5492190059430744150.gal : 6 ms
[2024-05-23 09:22:34] [INFO ] Time to serialize properties into /tmp/LTL16753406606505026275.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/LTL5492190059430744150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16753406606505026275.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.i1.u9.next_11==1)&&(i4.u20.ncs_3_10==1))"))U((G(!("((i2.i1.u9.next_11==1)&&(i4.u20.ncs_3_10==1))")))||("((!(((i2.i1.u9...297
Formula 0 simplified : FG("((i2.i1.u9.next_11==1)&&(i4.u20.ncs_3_10==1))" M !"((!(((i2.i1.u9.next_11==1)&&(i11.u61.ncs_9_3==1))&&((i2.i1.u9.next_11==1)&&(i...229
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-15 finished in 122902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p0&&X(X(G(p2))))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-03
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Support contains 5 out of 546 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 234 place count 422 transition count 778
Iterating global reduction 0 with 14 rules applied. Total rules applied 248 place count 422 transition count 778
Applied a total of 248 rules in 32 ms. Remains 422 /546 variables (removed 124) and now considering 778/1182 (removed 404) transitions.
// Phase 1: matrix 778 rows 422 cols
[2024-05-23 09:22:50] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 09:22:51] [INFO ] Implicit Places using invariants in 978 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 980 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/546 places, 778/1182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 17 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2024-05-23 09:22:51] [INFO ] Computed 24 invariants in 10 ms
[2024-05-23 09:22:51] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-23 09:22:51] [INFO ] Invariant cache hit.
[2024-05-23 09:22:51] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:22:53] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/546 places, 660/1182 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3154 ms. Remains : 303/546 places, 660/1182 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 252 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 118 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28892 steps (6 resets) in 34 ms. (825 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 20 factoid took 214 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-23 09:22:54] [INFO ] Invariant cache hit.
[2024-05-23 09:22:54] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-23 09:22:54] [INFO ] Invariant cache hit.
[2024-05-23 09:22:55] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:22:56] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
Running 649 sub problems to find dead transitions.
[2024-05-23 09:22:56] [INFO ] Invariant cache hit.
[2024-05-23 09:22:56] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-23 09:23:02] [INFO ] Deduced a trap composed of 137 places in 284 ms of which 6 ms to minimize.
[2024-05-23 09:23:03] [INFO ] Deduced a trap composed of 116 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:23:05] [INFO ] Deduced a trap composed of 86 places in 290 ms of which 3 ms to minimize.
[2024-05-23 09:23:06] [INFO ] Deduced a trap composed of 105 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:23:06] [INFO ] Deduced a trap composed of 100 places in 289 ms of which 3 ms to minimize.
[2024-05-23 09:23:07] [INFO ] Deduced a trap composed of 99 places in 287 ms of which 3 ms to minimize.
[2024-05-23 09:23:07] [INFO ] Deduced a trap composed of 107 places in 278 ms of which 4 ms to minimize.
[2024-05-23 09:23:07] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:23:08] [INFO ] Deduced a trap composed of 124 places in 238 ms of which 3 ms to minimize.
[2024-05-23 09:23:08] [INFO ] Deduced a trap composed of 99 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:23:08] [INFO ] Deduced a trap composed of 126 places in 271 ms of which 4 ms to minimize.
[2024-05-23 09:23:09] [INFO ] Deduced a trap composed of 149 places in 281 ms of which 3 ms to minimize.
[2024-05-23 09:23:09] [INFO ] Deduced a trap composed of 113 places in 299 ms of which 4 ms to minimize.
[2024-05-23 09:23:09] [INFO ] Deduced a trap composed of 131 places in 287 ms of which 4 ms to minimize.
[2024-05-23 09:23:09] [INFO ] Deduced a trap composed of 106 places in 279 ms of which 4 ms to minimize.
[2024-05-23 09:23:10] [INFO ] Deduced a trap composed of 115 places in 276 ms of which 4 ms to minimize.
[2024-05-23 09:23:10] [INFO ] Deduced a trap composed of 132 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:23:11] [INFO ] Deduced a trap composed of 116 places in 289 ms of which 3 ms to minimize.
[2024-05-23 09:23:11] [INFO ] Deduced a trap composed of 109 places in 203 ms of which 3 ms to minimize.
[2024-05-23 09:23:11] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-23 09:23:12] [INFO ] Deduced a trap composed of 54 places in 274 ms of which 3 ms to minimize.
[2024-05-23 09:23:14] [INFO ] Deduced a trap composed of 113 places in 280 ms of which 3 ms to minimize.
[2024-05-23 09:23:14] [INFO ] Deduced a trap composed of 99 places in 290 ms of which 3 ms to minimize.
[2024-05-23 09:23:14] [INFO ] Deduced a trap composed of 112 places in 286 ms of which 3 ms to minimize.
[2024-05-23 09:23:14] [INFO ] Deduced a trap composed of 94 places in 295 ms of which 3 ms to minimize.
[2024-05-23 09:23:15] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 3 ms to minimize.
[2024-05-23 09:23:15] [INFO ] Deduced a trap composed of 92 places in 285 ms of which 3 ms to minimize.
[2024-05-23 09:23:15] [INFO ] Deduced a trap composed of 100 places in 286 ms of which 4 ms to minimize.
[2024-05-23 09:23:16] [INFO ] Deduced a trap composed of 100 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:23:16] [INFO ] Deduced a trap composed of 121 places in 285 ms of which 3 ms to minimize.
[2024-05-23 09:23:16] [INFO ] Deduced a trap composed of 118 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:23:16] [INFO ] Deduced a trap composed of 106 places in 294 ms of which 3 ms to minimize.
[2024-05-23 09:23:17] [INFO ] Deduced a trap composed of 96 places in 213 ms of which 3 ms to minimize.
[2024-05-23 09:23:17] [INFO ] Deduced a trap composed of 81 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:23:17] [INFO ] Deduced a trap composed of 107 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:23:18] [INFO ] Deduced a trap composed of 120 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:23:18] [INFO ] Deduced a trap composed of 97 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:23:18] [INFO ] Deduced a trap composed of 97 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:23:18] [INFO ] Deduced a trap composed of 88 places in 279 ms of which 3 ms to minimize.
[2024-05-23 09:23:19] [INFO ] Deduced a trap composed of 73 places in 330 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-23 09:23:25] [INFO ] Deduced a trap composed of 119 places in 275 ms of which 4 ms to minimize.
[2024-05-23 09:23:25] [INFO ] Deduced a trap composed of 97 places in 282 ms of which 3 ms to minimize.
[2024-05-23 09:23:25] [INFO ] Deduced a trap composed of 94 places in 280 ms of which 3 ms to minimize.
[2024-05-23 09:23:26] [INFO ] Deduced a trap composed of 89 places in 244 ms of which 3 ms to minimize.
[2024-05-23 09:23:26] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:23:26] [INFO ] Deduced a trap composed of 80 places in 287 ms of which 4 ms to minimize.
[2024-05-23 09:23:26] [INFO ] Deduced a trap composed of 73 places in 280 ms of which 3 ms to minimize.
[2024-05-23 09:23:27] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 3 ms to minimize.
SMT process timed out in 30664ms, After SMT, problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 30672ms
Finished structural reductions in LTL mode , in 1 iterations and 32871 ms. Remains : 303/303 places, 660/660 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 18816 steps (3 resets) in 24 ms. (752 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 225 ms.
Product exploration explored 100000 steps with 0 reset in 246 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 660
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 302 transition count 639
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 302 transition count 639
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 16 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
[2024-05-23 09:23:28] [INFO ] Redundant transitions in 5 ms returned []
Running 628 sub problems to find dead transitions.
// Phase 1: matrix 639 rows 302 cols
[2024-05-23 09:23:28] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 09:23:28] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-05-23 09:23:36] [INFO ] Deduced a trap composed of 116 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:23:36] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:23:37] [INFO ] Deduced a trap composed of 105 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:23:37] [INFO ] Deduced a trap composed of 103 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:23:37] [INFO ] Deduced a trap composed of 93 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:23:37] [INFO ] Deduced a trap composed of 95 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:23:38] [INFO ] Deduced a trap composed of 83 places in 276 ms of which 3 ms to minimize.
[2024-05-23 09:23:38] [INFO ] Deduced a trap composed of 81 places in 258 ms of which 3 ms to minimize.
[2024-05-23 09:23:38] [INFO ] Deduced a trap composed of 83 places in 296 ms of which 3 ms to minimize.
[2024-05-23 09:23:39] [INFO ] Deduced a trap composed of 83 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:23:39] [INFO ] Deduced a trap composed of 75 places in 274 ms of which 4 ms to minimize.
[2024-05-23 09:23:39] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:23:39] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 4 ms to minimize.
[2024-05-23 09:23:40] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 3 ms to minimize.
[2024-05-23 09:23:40] [INFO ] Deduced a trap composed of 79 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:23:40] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:23:41] [INFO ] Deduced a trap composed of 103 places in 257 ms of which 4 ms to minimize.
[2024-05-23 09:23:41] [INFO ] Deduced a trap composed of 83 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:23:41] [INFO ] Deduced a trap composed of 87 places in 253 ms of which 3 ms to minimize.
[2024-05-23 09:23:41] [INFO ] Deduced a trap composed of 91 places in 255 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-05-23 09:23:43] [INFO ] Deduced a trap composed of 80 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:23:44] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:23:45] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 3 ms to minimize.
[2024-05-23 09:23:45] [INFO ] Deduced a trap composed of 80 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:23:46] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:23:46] [INFO ] Deduced a trap composed of 92 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:23:46] [INFO ] Deduced a trap composed of 90 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:23:46] [INFO ] Deduced a trap composed of 85 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:23:47] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:23:47] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:23:47] [INFO ] Deduced a trap composed of 109 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:23:48] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:23:48] [INFO ] Deduced a trap composed of 128 places in 277 ms of which 3 ms to minimize.
[2024-05-23 09:23:48] [INFO ] Deduced a trap composed of 115 places in 236 ms of which 3 ms to minimize.
[2024-05-23 09:23:49] [INFO ] Deduced a trap composed of 97 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:23:49] [INFO ] Deduced a trap composed of 113 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:23:49] [INFO ] Deduced a trap composed of 111 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:23:49] [INFO ] Deduced a trap composed of 106 places in 258 ms of which 4 ms to minimize.
[2024-05-23 09:23:50] [INFO ] Deduced a trap composed of 113 places in 272 ms of which 4 ms to minimize.
[2024-05-23 09:23:50] [INFO ] Deduced a trap composed of 104 places in 271 ms of which 3 ms to minimize.
Problem TDEAD525 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/64 constraints. Problems are: Problem set: 1 solved, 627 unsolved
[2024-05-23 09:23:57] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 4 ms to minimize.
[2024-05-23 09:23:58] [INFO ] Deduced a trap composed of 94 places in 195 ms of which 3 ms to minimize.
[2024-05-23 09:23:58] [INFO ] Deduced a trap composed of 80 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:23:59] [INFO ] Deduced a trap composed of 77 places in 232 ms of which 3 ms to minimize.
[2024-05-23 09:23:59] [INFO ] Deduced a trap composed of 83 places in 268 ms of which 3 ms to minimize.
SMT process timed out in 30825ms, After SMT, problems are : Problem set: 1 solved, 627 unsolved
Search for dead transitions found 1 dead transitions in 30832ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 302/303 places, 638/660 transitions.
Graph (complete) has 1682 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 301 /302 variables (removed 1) and now considering 638/638 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/303 places, 638/660 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30874 ms. Remains : 301/303 places, 638/660 transitions.
Built C files in :
/tmp/ltsmin7689564479211658374
[2024-05-23 09:23:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7689564479211658374
Running compilation step : cd /tmp/ltsmin7689564479211658374;'/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 2120 ms.
Running link step : cd /tmp/ltsmin7689564479211658374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7689564479211658374;'/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/stateBased17074332855461216456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 302 transition count 639
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 302 transition count 639
Applied a total of 2 rules in 8 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
// Phase 1: matrix 639 rows 302 cols
[2024-05-23 09:24:14] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 09:24:15] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-23 09:24:15] [INFO ] Invariant cache hit.
[2024-05-23 09:24:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:24:16] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
Running 628 sub problems to find dead transitions.
[2024-05-23 09:24:16] [INFO ] Invariant cache hit.
[2024-05-23 09:24:16] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-05-23 09:24:23] [INFO ] Deduced a trap composed of 83 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:24:24] [INFO ] Deduced a trap composed of 87 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:24:24] [INFO ] Deduced a trap composed of 53 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:24:25] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:24:25] [INFO ] Deduced a trap composed of 107 places in 288 ms of which 3 ms to minimize.
[2024-05-23 09:24:26] [INFO ] Deduced a trap composed of 112 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:24:26] [INFO ] Deduced a trap composed of 111 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:24:26] [INFO ] Deduced a trap composed of 101 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:24:27] [INFO ] Deduced a trap composed of 96 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:24:27] [INFO ] Deduced a trap composed of 143 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:24:27] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-23 09:24:28] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:24:28] [INFO ] Deduced a trap composed of 102 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:24:28] [INFO ] Deduced a trap composed of 110 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:24:28] [INFO ] Deduced a trap composed of 101 places in 262 ms of which 4 ms to minimize.
[2024-05-23 09:24:29] [INFO ] Deduced a trap composed of 95 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:24:29] [INFO ] Deduced a trap composed of 105 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:24:29] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:24:30] [INFO ] Deduced a trap composed of 96 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:24:30] [INFO ] Deduced a trap composed of 95 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-05-23 09:24:32] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 3 ms to minimize.
[2024-05-23 09:24:32] [INFO ] Deduced a trap composed of 96 places in 276 ms of which 4 ms to minimize.
[2024-05-23 09:24:32] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 4 ms to minimize.
[2024-05-23 09:24:33] [INFO ] Deduced a trap composed of 83 places in 266 ms of which 4 ms to minimize.
[2024-05-23 09:24:33] [INFO ] Deduced a trap composed of 82 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:24:34] [INFO ] Deduced a trap composed of 114 places in 207 ms of which 3 ms to minimize.
[2024-05-23 09:24:34] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:24:35] [INFO ] Deduced a trap composed of 131 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:24:35] [INFO ] Deduced a trap composed of 123 places in 278 ms of which 5 ms to minimize.
[2024-05-23 09:24:35] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:24:36] [INFO ] Deduced a trap composed of 81 places in 232 ms of which 4 ms to minimize.
[2024-05-23 09:24:36] [INFO ] Deduced a trap composed of 148 places in 282 ms of which 3 ms to minimize.
[2024-05-23 09:24:36] [INFO ] Deduced a trap composed of 167 places in 281 ms of which 3 ms to minimize.
[2024-05-23 09:24:37] [INFO ] Deduced a trap composed of 99 places in 279 ms of which 4 ms to minimize.
[2024-05-23 09:24:37] [INFO ] Deduced a trap composed of 137 places in 277 ms of which 3 ms to minimize.
[2024-05-23 09:24:37] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 3 ms to minimize.
[2024-05-23 09:24:37] [INFO ] Deduced a trap composed of 104 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:24:38] [INFO ] Deduced a trap composed of 126 places in 277 ms of which 3 ms to minimize.
[2024-05-23 09:24:38] [INFO ] Deduced a trap composed of 131 places in 280 ms of which 3 ms to minimize.
[2024-05-23 09:24:38] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-05-23 09:24:47] [INFO ] Deduced a trap composed of 82 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:24:47] [INFO ] Deduced a trap composed of 74 places in 308 ms of which 3 ms to minimize.
[2024-05-23 09:24:47] [INFO ] Deduced a trap composed of 75 places in 304 ms of which 4 ms to minimize.
SMT process timed out in 30800ms, After SMT, problems are : Problem set: 0 solved, 628 unsolved
Search for dead transitions found 0 dead transitions in 30807ms
Starting structural reductions in LTL mode, iteration 1 : 302/303 places, 639/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33037 ms. Remains : 302/303 places, 639/660 transitions.
Built C files in :
/tmp/ltsmin5935177564581087572
[2024-05-23 09:24:47] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5935177564581087572
Running compilation step : cd /tmp/ltsmin5935177564581087572;'/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 2155 ms.
Running link step : cd /tmp/ltsmin5935177564581087572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5935177564581087572;'/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/stateBased9022760847814555314.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 09:25:02] [INFO ] Flatten gal took : 32 ms
[2024-05-23 09:25:02] [INFO ] Flatten gal took : 21 ms
[2024-05-23 09:25:02] [INFO ] Time to serialize gal into /tmp/LTL10227403176018145106.gal : 4 ms
[2024-05-23 09:25:02] [INFO ] Time to serialize properties into /tmp/LTL2659988656085402114.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10227403176018145106.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7169714400342098904.hoa' '-atoms' '/tmp/LTL2659988656085402114.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/LTL2659988656085402114.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7169714400342098904.hoa
Detected timeout of ITS tools.
[2024-05-23 09:25:17] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:25:17] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:25:17] [INFO ] Time to serialize gal into /tmp/LTL4621360196505239756.gal : 4 ms
[2024-05-23 09:25:17] [INFO ] Time to serialize properties into /tmp/LTL1682394828874662069.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/LTL4621360196505239756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1682394828874662069.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 : !(((("((next_16==1)&&(ncs_0_8==1))")U("((next_13==1)&&(ncs_8_5==1))"))U((!("((next_16==1)&&(ncs_0_8==1))"))&&(X(X(G("(((next_13==1)&&(...209
Formula 0 simplified : (!"((next_16==1)&&(ncs_0_8==1))" R !"((next_13==1)&&(ncs_8_5==1))") R ("((next_16==1)&&(ncs_0_8==1))" | XXF!"(((next_13==1)&&(ncs_6_...197
Detected timeout of ITS tools.
[2024-05-23 09:25:33] [INFO ] Flatten gal took : 18 ms
[2024-05-23 09:25:33] [INFO ] Applying decomposition
[2024-05-23 09:25:33] [INFO ] Flatten gal took : 21 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/graph130695238404753509.txt' '-o' '/tmp/graph130695238404753509.bin' '-w' '/tmp/graph130695238404753509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph130695238404753509.bin' '-l' '-1' '-v' '-w' '/tmp/graph130695238404753509.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:25:33] [INFO ] Decomposing Gal with order
[2024-05-23 09:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:25:33] [INFO ] Removed a total of 1181 redundant transitions.
[2024-05-23 09:25:33] [INFO ] Flatten gal took : 51 ms
[2024-05-23 09:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 16 ms.
[2024-05-23 09:25:33] [INFO ] Time to serialize gal into /tmp/LTL14388470385815856827.gal : 7 ms
[2024-05-23 09:25:33] [INFO ] Time to serialize properties into /tmp/LTL14512658095734935227.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/LTL14388470385815856827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14512658095734935227.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 : !(((("((i3.i0.u11.next_16==1)&&(i8.u14.ncs_0_8==1))")U("((i2.i0.u9.next_13==1)&&(u59.ncs_8_5==1))"))U((!("((i3.i0.u11.next_16==1)&&(i8...288
Formula 0 simplified : (!"((i3.i0.u11.next_16==1)&&(i8.u14.ncs_0_8==1))" R !"((i2.i0.u9.next_13==1)&&(u59.ncs_8_5==1))") R ("((i3.i0.u11.next_16==1)&&(i8.u...276
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 178780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-09
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 546/546 places, 1182/1182 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 546 transition count 1072
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 436 transition count 1072
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 236 place count 420 transition count 736
Iterating global reduction 0 with 16 rules applied. Total rules applied 252 place count 420 transition count 736
Applied a total of 252 rules in 31 ms. Remains 420 /546 variables (removed 126) and now considering 736/1182 (removed 446) transitions.
// Phase 1: matrix 736 rows 420 cols
[2024-05-23 09:25:48] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 09:25:49] [INFO ] Implicit Places using invariants in 812 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 813 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 419/546 places, 736/1182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 11 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2024-05-23 09:25:49] [INFO ] Computed 24 invariants in 15 ms
[2024-05-23 09:25:49] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-23 09:25:49] [INFO ] Invariant cache hit.
[2024-05-23 09:25:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:25:51] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 299/546 places, 616/1182 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2841 ms. Remains : 299/546 places, 616/1182 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 829799 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 829799 steps, saw 625305 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2024-05-23 09:25:55] [INFO ] Invariant cache hit.
[2024-05-23 09:25:55] [INFO ] State equation strengthened by 110 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) 265/267 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/288 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 09:25:55] [INFO ] Deduced a trap composed of 219 places in 217 ms of which 3 ms to minimize.
[2024-05-23 09:25:55] [INFO ] Deduced a trap composed of 219 places in 224 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/299 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 616/915 variables, 299/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 110/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/915 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 915/915 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 299/299 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 265/267 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/288 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/299 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 09:25:56] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 616/915 variables, 299/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 110/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/915 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/915 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 915/915 variables, and 437 constraints, problems are : Problem set: 0 solved, 1 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 299/299 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1611ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 4 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2024-05-23 09:25:57] [INFO ] Invariant cache hit.
[2024-05-23 09:25:57] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-23 09:25:57] [INFO ] Invariant cache hit.
[2024-05-23 09:25:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:25:58] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-23 09:25:58] [INFO ] Invariant cache hit.
[2024-05-23 09:25:58] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:26:06] [INFO ] Deduced a trap composed of 80 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:26:06] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-05-23 09:26:07] [INFO ] Deduced a trap composed of 88 places in 246 ms of which 3 ms to minimize.
[2024-05-23 09:26:07] [INFO ] Deduced a trap composed of 110 places in 250 ms of which 3 ms to minimize.
[2024-05-23 09:26:07] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 4 ms to minimize.
[2024-05-23 09:26:07] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:26:08] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 3 ms to minimize.
[2024-05-23 09:26:08] [INFO ] Deduced a trap composed of 98 places in 264 ms of which 4 ms to minimize.
[2024-05-23 09:26:08] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 3 ms to minimize.
[2024-05-23 09:26:08] [INFO ] Deduced a trap composed of 100 places in 242 ms of which 3 ms to minimize.
[2024-05-23 09:26:09] [INFO ] Deduced a trap composed of 83 places in 242 ms of which 3 ms to minimize.
[2024-05-23 09:26:09] [INFO ] Deduced a trap composed of 94 places in 250 ms of which 3 ms to minimize.
[2024-05-23 09:26:09] [INFO ] Deduced a trap composed of 101 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:26:09] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:26:10] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 4 ms to minimize.
[2024-05-23 09:26:10] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:26:10] [INFO ] Deduced a trap composed of 118 places in 270 ms of which 4 ms to minimize.
[2024-05-23 09:26:11] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 4 ms to minimize.
[2024-05-23 09:26:11] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 4 ms to minimize.
[2024-05-23 09:26:11] [INFO ] Deduced a trap composed of 89 places in 207 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:26:14] [INFO ] Deduced a trap composed of 87 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:26:14] [INFO ] Deduced a trap composed of 70 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:26:15] [INFO ] Deduced a trap composed of 75 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:26:15] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 4 ms to minimize.
[2024-05-23 09:26:16] [INFO ] Deduced a trap composed of 95 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:26:16] [INFO ] Deduced a trap composed of 124 places in 273 ms of which 4 ms to minimize.
[2024-05-23 09:26:16] [INFO ] Deduced a trap composed of 73 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:26:17] [INFO ] Deduced a trap composed of 93 places in 253 ms of which 4 ms to minimize.
[2024-05-23 09:26:17] [INFO ] Deduced a trap composed of 137 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:26:17] [INFO ] Deduced a trap composed of 139 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:26:18] [INFO ] Deduced a trap composed of 123 places in 224 ms of which 3 ms to minimize.
[2024-05-23 09:26:18] [INFO ] Deduced a trap composed of 133 places in 277 ms of which 3 ms to minimize.
[2024-05-23 09:26:18] [INFO ] Deduced a trap composed of 96 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:26:19] [INFO ] Deduced a trap composed of 96 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:26:19] [INFO ] Deduced a trap composed of 94 places in 275 ms of which 4 ms to minimize.
[2024-05-23 09:26:19] [INFO ] Deduced a trap composed of 88 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:26:19] [INFO ] Deduced a trap composed of 115 places in 266 ms of which 3 ms to minimize.
[2024-05-23 09:26:20] [INFO ] Deduced a trap composed of 120 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:26:20] [INFO ] Deduced a trap composed of 143 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:26:20] [INFO ] Deduced a trap composed of 129 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:26:28] [INFO ] Deduced a trap composed of 78 places in 269 ms of which 3 ms to minimize.
[2024-05-23 09:26:28] [INFO ] Deduced a trap composed of 114 places in 267 ms of which 4 ms to minimize.
[2024-05-23 09:26:29] [INFO ] Deduced a trap composed of 103 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:26:29] [INFO ] Deduced a trap composed of 103 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:26:29] [INFO ] Deduced a trap composed of 94 places in 258 ms of which 3 ms to minimize.
SMT process timed out in 30756ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30762ms
Finished structural reductions in LTL mode , in 1 iterations and 32730 ms. Remains : 299/299 places, 616/616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37986 steps (8 resets) in 42 ms. (883 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 201 ms.
Product exploration explored 100000 steps with 0 reset in 225 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 8 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2024-05-23 09:26:31] [INFO ] Redundant transitions in 4 ms returned []
Running 605 sub problems to find dead transitions.
[2024-05-23 09:26:31] [INFO ] Invariant cache hit.
[2024-05-23 09:26:31] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:26:38] [INFO ] Deduced a trap composed of 80 places in 281 ms of which 3 ms to minimize.
[2024-05-23 09:26:39] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 4 ms to minimize.
[2024-05-23 09:26:39] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:26:39] [INFO ] Deduced a trap composed of 110 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:26:39] [INFO ] Deduced a trap composed of 83 places in 258 ms of which 4 ms to minimize.
[2024-05-23 09:26:40] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:26:40] [INFO ] Deduced a trap composed of 88 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:26:40] [INFO ] Deduced a trap composed of 98 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:26:41] [INFO ] Deduced a trap composed of 108 places in 278 ms of which 3 ms to minimize.
[2024-05-23 09:26:41] [INFO ] Deduced a trap composed of 100 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:26:41] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:26:41] [INFO ] Deduced a trap composed of 94 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:26:42] [INFO ] Deduced a trap composed of 101 places in 317 ms of which 3 ms to minimize.
[2024-05-23 09:26:42] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:26:42] [INFO ] Deduced a trap composed of 105 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:26:43] [INFO ] Deduced a trap composed of 96 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:26:43] [INFO ] Deduced a trap composed of 118 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:26:43] [INFO ] Deduced a trap composed of 91 places in 273 ms of which 4 ms to minimize.
[2024-05-23 09:26:44] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 4 ms to minimize.
[2024-05-23 09:26:44] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:26:47] [INFO ] Deduced a trap composed of 87 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:26:47] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 4 ms to minimize.
[2024-05-23 09:26:47] [INFO ] Deduced a trap composed of 75 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:26:48] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 3 ms to minimize.
[2024-05-23 09:26:48] [INFO ] Deduced a trap composed of 95 places in 274 ms of which 3 ms to minimize.
[2024-05-23 09:26:49] [INFO ] Deduced a trap composed of 124 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:26:49] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 4 ms to minimize.
[2024-05-23 09:26:49] [INFO ] Deduced a trap composed of 93 places in 272 ms of which 4 ms to minimize.
[2024-05-23 09:26:50] [INFO ] Deduced a trap composed of 137 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:26:50] [INFO ] Deduced a trap composed of 139 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:26:50] [INFO ] Deduced a trap composed of 123 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:26:51] [INFO ] Deduced a trap composed of 133 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:26:51] [INFO ] Deduced a trap composed of 96 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:26:51] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:26:51] [INFO ] Deduced a trap composed of 94 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:26:52] [INFO ] Deduced a trap composed of 88 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:26:52] [INFO ] Deduced a trap composed of 115 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:26:52] [INFO ] Deduced a trap composed of 120 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:26:52] [INFO ] Deduced a trap composed of 143 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:26:53] [INFO ] Deduced a trap composed of 129 places in 258 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:27:00] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 3 ms to minimize.
[2024-05-23 09:27:01] [INFO ] Deduced a trap composed of 114 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:27:01] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 4 ms to minimize.
[2024-05-23 09:27:01] [INFO ] Deduced a trap composed of 103 places in 261 ms of which 3 ms to minimize.
SMT process timed out in 30581ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30587ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30609 ms. Remains : 299/299 places, 616/616 transitions.
Built C files in :
/tmp/ltsmin6725012533455783143
[2024-05-23 09:27:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6725012533455783143
Running compilation step : cd /tmp/ltsmin6725012533455783143;'/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 1980 ms.
Running link step : cd /tmp/ltsmin6725012533455783143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6725012533455783143;'/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/stateBased4676925470151068851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 5 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2024-05-23 09:27:16] [INFO ] Invariant cache hit.
[2024-05-23 09:27:17] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-23 09:27:17] [INFO ] Invariant cache hit.
[2024-05-23 09:27:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:27:18] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-23 09:27:18] [INFO ] Invariant cache hit.
[2024-05-23 09:27:18] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:27:26] [INFO ] Deduced a trap composed of 80 places in 250 ms of which 4 ms to minimize.
[2024-05-23 09:27:26] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-23 09:27:26] [INFO ] Deduced a trap composed of 88 places in 253 ms of which 3 ms to minimize.
[2024-05-23 09:27:27] [INFO ] Deduced a trap composed of 110 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:27:27] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:27:27] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:27:28] [INFO ] Deduced a trap composed of 88 places in 310 ms of which 3 ms to minimize.
[2024-05-23 09:27:28] [INFO ] Deduced a trap composed of 98 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:27:28] [INFO ] Deduced a trap composed of 108 places in 288 ms of which 4 ms to minimize.
[2024-05-23 09:27:28] [INFO ] Deduced a trap composed of 100 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:27:29] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:27:29] [INFO ] Deduced a trap composed of 94 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:27:29] [INFO ] Deduced a trap composed of 101 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:27:29] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 3 ms to minimize.
[2024-05-23 09:27:30] [INFO ] Deduced a trap composed of 105 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:27:30] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 3 ms to minimize.
[2024-05-23 09:27:30] [INFO ] Deduced a trap composed of 118 places in 264 ms of which 4 ms to minimize.
[2024-05-23 09:27:31] [INFO ] Deduced a trap composed of 91 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:27:31] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:27:31] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:27:34] [INFO ] Deduced a trap composed of 87 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:27:35] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 3 ms to minimize.
[2024-05-23 09:27:35] [INFO ] Deduced a trap composed of 75 places in 240 ms of which 4 ms to minimize.
[2024-05-23 09:27:35] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:27:36] [INFO ] Deduced a trap composed of 95 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:27:36] [INFO ] Deduced a trap composed of 124 places in 283 ms of which 4 ms to minimize.
[2024-05-23 09:27:37] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 4 ms to minimize.
[2024-05-23 09:27:37] [INFO ] Deduced a trap composed of 93 places in 209 ms of which 3 ms to minimize.
[2024-05-23 09:27:37] [INFO ] Deduced a trap composed of 137 places in 250 ms of which 3 ms to minimize.
[2024-05-23 09:27:38] [INFO ] Deduced a trap composed of 139 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:27:38] [INFO ] Deduced a trap composed of 123 places in 254 ms of which 4 ms to minimize.
[2024-05-23 09:27:38] [INFO ] Deduced a trap composed of 133 places in 264 ms of which 3 ms to minimize.
[2024-05-23 09:27:38] [INFO ] Deduced a trap composed of 96 places in 257 ms of which 3 ms to minimize.
[2024-05-23 09:27:39] [INFO ] Deduced a trap composed of 96 places in 268 ms of which 3 ms to minimize.
[2024-05-23 09:27:39] [INFO ] Deduced a trap composed of 94 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:27:39] [INFO ] Deduced a trap composed of 88 places in 274 ms of which 19 ms to minimize.
[2024-05-23 09:27:40] [INFO ] Deduced a trap composed of 115 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:27:40] [INFO ] Deduced a trap composed of 120 places in 260 ms of which 4 ms to minimize.
[2024-05-23 09:27:40] [INFO ] Deduced a trap composed of 143 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:27:40] [INFO ] Deduced a trap composed of 129 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-23 09:27:48] [INFO ] Deduced a trap composed of 78 places in 274 ms of which 3 ms to minimize.
[2024-05-23 09:27:49] [INFO ] Deduced a trap composed of 114 places in 284 ms of which 4 ms to minimize.
[2024-05-23 09:27:49] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 4 ms to minimize.
SMT process timed out in 30620ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30651ms
Finished structural reductions in LTL mode , in 1 iterations and 32544 ms. Remains : 299/299 places, 616/616 transitions.
Built C files in :
/tmp/ltsmin1270051171681722331
[2024-05-23 09:27:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1270051171681722331
Running compilation step : cd /tmp/ltsmin1270051171681722331;'/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 2149 ms.
Running link step : cd /tmp/ltsmin1270051171681722331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1270051171681722331;'/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/stateBased3928931057757321870.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 09:28:04] [INFO ] Flatten gal took : 18 ms
[2024-05-23 09:28:04] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:28:04] [INFO ] Time to serialize gal into /tmp/LTL12683683723581768682.gal : 13 ms
[2024-05-23 09:28:04] [INFO ] Time to serialize properties into /tmp/LTL17712590390329874096.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/LTL12683683723581768682.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9326541160109367401.hoa' '-atoms' '/tmp/LTL17712590390329874096.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/LTL17712590390329874096.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9326541160109367401.hoa
Detected timeout of ITS tools.
[2024-05-23 09:28:19] [INFO ] Flatten gal took : 17 ms
[2024-05-23 09:28:19] [INFO ] Flatten gal took : 17 ms
[2024-05-23 09:28:19] [INFO ] Time to serialize gal into /tmp/LTL5965490362497138847.gal : 5 ms
[2024-05-23 09:28:19] [INFO ] Time to serialize properties into /tmp/LTL10234778199700804438.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/LTL5965490362497138847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10234778199700804438.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 : !((X(X(G("((next_15!=1)||(ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((next_15!=1)||(ncs_10_8!=1))"
Detected timeout of ITS tools.
[2024-05-23 09:28:34] [INFO ] Flatten gal took : 18 ms
[2024-05-23 09:28:34] [INFO ] Applying decomposition
[2024-05-23 09:28:34] [INFO ] Flatten gal took : 17 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/graph13802024853230769786.txt' '-o' '/tmp/graph13802024853230769786.bin' '-w' '/tmp/graph13802024853230769786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13802024853230769786.bin' '-l' '-1' '-v' '-w' '/tmp/graph13802024853230769786.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:28:34] [INFO ] Decomposing Gal with order
[2024-05-23 09:28:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:28:34] [INFO ] Removed a total of 1174 redundant transitions.
[2024-05-23 09:28:34] [INFO ] Flatten gal took : 49 ms
[2024-05-23 09:28:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 12 ms.
[2024-05-23 09:28:34] [INFO ] Time to serialize gal into /tmp/LTL5000972052646593641.gal : 7 ms
[2024-05-23 09:28:34] [INFO ] Time to serialize properties into /tmp/LTL6158368895275656599.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/LTL5000972052646593641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6158368895275656599.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i2.u12.next_15!=1)||(i0.u39.ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((i2.u12.next_15!=1)||(i0.u39.ncs_10_8!=1))"
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 181740 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((!p0 U (p1||G(!p0))))))'
[2024-05-23 09:28:50] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9224340384395822650
[2024-05-23 09:28:50] [INFO ] Computing symmetric may disable matrix : 1182 transitions.
[2024-05-23 09:28:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:28:50] [INFO ] Computing symmetric may enable matrix : 1182 transitions.
[2024-05-23 09:28:50] [INFO ] Applying decomposition
[2024-05-23 09:28:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:28:50] [INFO ] Flatten gal took : 40 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/graph18101144983681059056.txt' '-o' '/tmp/graph18101144983681059056.bin' '-w' '/tmp/graph18101144983681059056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18101144983681059056.bin' '-l' '-1' '-v' '-w' '/tmp/graph18101144983681059056.weights' '-q' '0' '-e' '0.001'
[2024-05-23 09:28:50] [INFO ] Decomposing Gal with order
[2024-05-23 09:28:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:28:50] [INFO ] Computing Do-Not-Accords matrix : 1182 transitions.
[2024-05-23 09:28:50] [INFO ] Removed a total of 2156 redundant transitions.
[2024-05-23 09:28:50] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 09:28:50] [INFO ] Flatten gal took : 86 ms
[2024-05-23 09:28:50] [INFO ] Built C files in 283ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9224340384395822650
Running compilation step : cd /tmp/ltsmin9224340384395822650;'/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-23 09:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 15 ms.
[2024-05-23 09:28:50] [INFO ] Time to serialize gal into /tmp/LTLFireability2064520235511653560.gal : 12 ms
[2024-05-23 09:28:50] [INFO ] Time to serialize properties into /tmp/LTLFireability14773617963610211742.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/LTLFireability2064520235511653560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14773617963610211742.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !(((("((i9.u8.next_16==1)&&(i5.u15.ncs_0_8==1))")U("((i9.u7.next_13==1)&&(i1.u119.ncs_8_5==1))"))U((!("((i9.u8.next_16==1)&&(i5.u15.nc...276
Formula 0 simplified : (!"((i9.u8.next_16==1)&&(i5.u15.ncs_0_8==1))" R !"((i9.u7.next_13==1)&&(i1.u119.ncs_8_5==1))") R ("((i9.u8.next_16==1)&&(i5.u15.ncs_...264
Compilation finished in 7696 ms.
Running link step : cd /tmp/ltsmin9224340384395822650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin9224340384395822650;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9224340384395822650;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9224340384395822650;'/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' 'X(X([]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9224340384395822650;'/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' 'X(X([]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9224340384395822650;'/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' '[](<>((!(LTLAPp4==true) U ((LTLAPp5==true)||[](!(LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9224340384395822650;'/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' '[](<>((!(LTLAPp4==true) U ((LTLAPp5==true)||[](!(LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9224340384395822650;'/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' '[](<>((!(LTLAPp6==true) U ((LTLAPp7==true)||[](!(LTLAPp6==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9224340384395822650;'/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' '[](<>((!(LTLAPp6==true) U ((LTLAPp7==true)||[](!(LTLAPp6==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9224340384395822650;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-23 09:51:16] [INFO ] Applying decomposition
[2024-05-23 09:51:16] [INFO ] Flatten gal took : 122 ms
[2024-05-23 09:51:16] [INFO ] Decomposing Gal with order
[2024-05-23 09:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 09:51:17] [INFO ] Removed a total of 1397 redundant transitions.
[2024-05-23 09:51:17] [INFO ] Flatten gal took : 353 ms
[2024-05-23 09:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 317 labels/synchronizations in 46 ms.
[2024-05-23 09:51:17] [INFO ] Time to serialize gal into /tmp/LTLFireability8491848407004560961.gal : 21 ms
[2024-05-23 09:51:17] [INFO ] Time to serialize properties into /tmp/LTLFireability12750129909908160542.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/LTLFireability8491848407004560961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12750129909908160542.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !(((("((u12.next_16==1)&&(u8.ncs_0_8==1))")U("((u12.next_13==1)&&(u5.ncs_8_5==1))"))U((!("((u12.next_16==1)&&(u8.ncs_0_8==1))"))&&(X(X...244
Formula 0 simplified : (!"((u12.next_16==1)&&(u8.ncs_0_8==1))" R !"((u12.next_13==1)&&(u5.ncs_8_5==1))") R ("((u12.next_16==1)&&(u8.ncs_0_8==1))" | XXF!"((...232
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.288: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.288: LTL layer: formula: (((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))
pins2lts-mc-linux64( 3/ 8), 0.300: "(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.301: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.364: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.377: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.378: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.377: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.384: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.384: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.643: There are 1191 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.643: State length is 547, there are 1223 groups
pins2lts-mc-linux64( 0/ 8), 0.643: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.643: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.643: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.643: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.764: [Blue] ~120 levels ~960 states ~3104 transitions
pins2lts-mc-linux64( 3/ 8), 0.832: [Blue] ~225 levels ~1920 states ~5656 transitions
pins2lts-mc-linux64( 3/ 8), 0.972: [Blue] ~445 levels ~3840 states ~10208 transitions
pins2lts-mc-linux64( 3/ 8), 1.251: [Blue] ~890 levels ~7680 states ~20536 transitions
pins2lts-mc-linux64( 3/ 8), 1.786: [Blue] ~1769 levels ~15360 states ~41848 transitions
pins2lts-mc-linux64( 3/ 8), 2.768: [Blue] ~3541 levels ~30720 states ~79200 transitions
pins2lts-mc-linux64( 3/ 8), 4.556: [Blue] ~6977 levels ~61440 states ~154120 transitions
pins2lts-mc-linux64( 3/ 8), 7.862: [Blue] ~13314 levels ~122880 states ~331736 transitions
pins2lts-mc-linux64( 3/ 8), 13.772: [Blue] ~26539 levels ~245760 states ~662872 transitions
pins2lts-mc-linux64( 3/ 8), 24.095: [Blue] ~52526 levels ~491520 states ~1379432 transitions
pins2lts-mc-linux64( 6/ 8), 43.154: [Blue] ~107849 levels ~983040 states ~2967696 transitions
pins2lts-mc-linux64( 5/ 8), 80.097: [Blue] ~217124 levels ~1966080 states ~5950688 transitions
pins2lts-mc-linux64( 0/ 8), 154.509: [Blue] ~448533 levels ~3932160 states ~12693824 transitions
pins2lts-mc-linux64( 0/ 8), 304.881: [Blue] ~894907 levels ~7864320 states ~25332976 transitions
pins2lts-mc-linux64( 0/ 8), 612.389: [Blue] ~1788647 levels ~15728640 states ~50771776 transitions
pins2lts-mc-linux64( 1/ 8), 1137.230: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1137.333:
pins2lts-mc-linux64( 0/ 8), 1137.333: Explored 29279692 states 88689955 transitions, fanout: 3.029
pins2lts-mc-linux64( 0/ 8), 1137.333: Total exploration time 1136.670 sec (1136.590 sec minimum, 1136.624 sec on average)
pins2lts-mc-linux64( 0/ 8), 1137.333: States per second: 25759, Transitions per second: 78026
pins2lts-mc-linux64( 0/ 8), 1137.333:
pins2lts-mc-linux64( 0/ 8), 1137.333: State space has 49189265 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1137.333: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1137.333: blue states: 29279692 (59.52%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1137.333: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1137.333: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1137.333:
pins2lts-mc-linux64( 0/ 8), 1137.333: Total memory used for local state coloring: 387.2MB
pins2lts-mc-linux64( 0/ 8), 1137.333:
pins2lts-mc-linux64( 0/ 8), 1137.333: Queue width: 8B, total height: 25374060, memory: 193.59MB
pins2lts-mc-linux64( 0/ 8), 1137.333: Tree memory: 631.3MB, 13.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1137.333: Tree fill ratio (roots/leafs): 36.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1137.333: Stored 1210 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1137.333: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1137.333: Est. total memory use: 824.9MB (~1217.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9224340384395822650;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9224340384395822650;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
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="Anderson-PT-11"
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 Anderson-PT-11, 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 r004-smll-171620118400372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 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 '
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 ;