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.r464-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 ltsminxred
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 r464-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 1717260198134

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:43:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:43:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:43:21] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2024-06-01 16:43:21] [INFO ] Transformed 749 places.
[2024-06-01 16:43:21] [INFO ] Transformed 3245 transitions.
[2024-06-01 16:43:21] [INFO ] Found NUPN structural information;
[2024-06-01 16:43:21] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 889 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 215 ms. Remains 546 /749 variables (removed 203) and now considering 1182/3245 (removed 2063) transitions.
// Phase 1: matrix 1182 rows 546 cols
[2024-06-01 16:43:22] [INFO ] Computed 25 invariants in 117 ms
[2024-06-01 16:43:23] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2024-06-01 16:43:23] [INFO ] Invariant cache hit.
[2024-06-01 16:43:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:43:30] [INFO ] Implicit Places using invariants and state equation in 6918 ms returned []
Implicit Place search using SMT with State Equation took 8448 ms to find 0 implicit places.
Running 1171 sub problems to find dead transitions.
[2024-06-01 16:43:30] [INFO ] Invariant cache hit.
[2024-06-01 16:43:30] [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-06-01 16:43:51] [INFO ] Deduced a trap composed of 137 places in 887 ms of which 81 ms to minimize.
[2024-06-01 16:43:52] [INFO ] Deduced a trap composed of 82 places in 548 ms of which 7 ms to minimize.
[2024-06-01 16:43:52] [INFO ] Deduced a trap composed of 211 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:43:53] [INFO ] Deduced a trap composed of 193 places in 399 ms of which 6 ms to minimize.
[2024-06-01 16:43:53] [INFO ] Deduced a trap composed of 143 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:43:53] [INFO ] Deduced a trap composed of 278 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:43:54] [INFO ] Deduced a trap composed of 119 places in 592 ms of which 5 ms to minimize.
[2024-06-01 16:43:54] [INFO ] Deduced a trap composed of 87 places in 489 ms of which 6 ms to minimize.
[2024-06-01 16:43:55] [INFO ] Deduced a trap composed of 82 places in 490 ms of which 6 ms to minimize.
[2024-06-01 16:43:56] [INFO ] Deduced a trap composed of 316 places in 666 ms of which 9 ms to minimize.
[2024-06-01 16:43:57] [INFO ] Deduced a trap composed of 187 places in 511 ms of which 5 ms to minimize.
[2024-06-01 16:43:57] [INFO ] Deduced a trap composed of 208 places in 518 ms of which 5 ms to minimize.
[2024-06-01 16:43:58] [INFO ] Deduced a trap composed of 144 places in 677 ms of which 5 ms to minimize.
[2024-06-01 16:43:59] [INFO ] Deduced a trap composed of 136 places in 479 ms of which 6 ms to minimize.
[2024-06-01 16:43:59] [INFO ] Deduced a trap composed of 124 places in 634 ms of which 9 ms to minimize.
[2024-06-01 16:44:00] [INFO ] Deduced a trap composed of 153 places in 683 ms of which 6 ms to minimize.
[2024-06-01 16:44:01] [INFO ] Deduced a trap composed of 271 places in 759 ms of which 8 ms to minimize.
[2024-06-01 16:44:01] [INFO ] Deduced a trap composed of 244 places in 694 ms of which 7 ms to minimize.
[2024-06-01 16:44:02] [INFO ] Deduced a trap composed of 92 places in 667 ms of which 8 ms to minimize.
[2024-06-01 16:44:03] [INFO ] Deduced a trap composed of 123 places in 773 ms of which 8 ms to minimize.
SMT process timed out in 32741ms, After SMT, problems are : Problem set: 0 solved, 1171 unsolved
Search for dead transitions found 0 dead transitions in 32790ms
Starting structural reductions in LTL mode, iteration 1 : 546/749 places, 1182/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41509 ms. Remains : 546/749 places, 1182/3245 transitions.
Support contains 32 out of 546 places after structural reductions.
[2024-06-01 16:44:04] [INFO ] Flatten gal took : 261 ms
[2024-06-01 16:44:04] [INFO ] Flatten gal took : 168 ms
[2024-06-01 16:44:04] [INFO ] Input system was already deterministic with 1182 transitions.
RANDOM walk for 40000 steps (8 resets) in 2630 ms. (15 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 479 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 320 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 386 ms. (103 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 5/5 properties
[2024-06-01 16:44:06] [INFO ] Invariant cache hit.
[2024-06-01 16:44:06] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 507/517 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/535 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/546 variables, 11/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1182/1728 variables, 546/571 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1728 variables, 110/681 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1728 variables, 0/681 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1728 variables, 0/681 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1728/1728 variables, and 681 constraints, problems are : Problem set: 1 solved, 4 unsolved in 976 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: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 509/515 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/534 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/546 variables, 12/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 16:44:08] [INFO ] Deduced a trap composed of 162 places in 477 ms of which 6 ms to minimize.
[2024-06-01 16:44:08] [INFO ] Deduced a trap composed of 130 places in 430 ms of which 6 ms to minimize.
[2024-06-01 16:44:09] [INFO ] Deduced a trap composed of 104 places in 708 ms of which 8 ms to minimize.
[2024-06-01 16:44:10] [INFO ] Deduced a trap composed of 119 places in 749 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 4/29 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 16:44:11] [INFO ] Deduced a trap composed of 184 places in 748 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1182/1728 variables, 546/576 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1728 variables, 110/686 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 690 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5018 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: 4/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 6078ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 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 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 233 place count 423 transition count 799
Iterating global reduction 0 with 13 rules applied. Total rules applied 246 place count 423 transition count 799
Applied a total of 246 rules in 154 ms. Remains 423 /546 variables (removed 123) and now considering 799/1182 (removed 383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 423/546 places, 799/1182 transitions.
RANDOM walk for 40000 steps (8 resets) in 691 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
// Phase 1: matrix 799 rows 423 cols
[2024-06-01 16:44:13] [INFO ] Computed 25 invariants in 53 ms
[2024-06-01 16:44:13] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 388/391 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/411 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/423 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 799/1222 variables, 423/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1222 variables, 110/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1222 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1222 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 558 constraints, problems are : Problem set: 0 solved, 2 unsolved in 867 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: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 388/391 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/411 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/423 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:44:14] [INFO ] Deduced a trap composed of 156 places in 467 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 799/1222 variables, 423/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1222 variables, 110/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1222 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1222 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1222 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 561 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2034 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: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2987ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 624 ms.
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 799/799 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 421 transition count 757
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 421 transition count 757
Applied a total of 4 rules in 98 ms. Remains 421 /423 variables (removed 2) and now considering 757/799 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 421/423 places, 757/799 transitions.
RANDOM walk for 40000 steps (8 resets) in 446 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 219831 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 219831 steps, saw 173208 distinct states, run finished after 3020 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 757 rows 421 cols
[2024-06-01 16:44:20] [INFO ] Computed 25 invariants in 45 ms
[2024-06-01 16:44:20] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 386/389 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/409 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/421 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 757/1178 variables, 421/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 110/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1178 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 421/421 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 386/389 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/409 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/421 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:44:21] [INFO ] Deduced a trap composed of 184 places in 559 ms of which 6 ms to minimize.
[2024-06-01 16:44:22] [INFO ] Deduced a trap composed of 208 places in 538 ms of which 7 ms to minimize.
[2024-06-01 16:44:22] [INFO ] Deduced a trap composed of 116 places in 522 ms of which 7 ms to minimize.
[2024-06-01 16:44:23] [INFO ] Deduced a trap composed of 114 places in 556 ms of which 6 ms to minimize.
[2024-06-01 16:44:24] [INFO ] Deduced a trap composed of 168 places in 591 ms of which 7 ms to minimize.
[2024-06-01 16:44:24] [INFO ] Deduced a trap composed of 268 places in 524 ms of which 8 ms to minimize.
[2024-06-01 16:44:25] [INFO ] Deduced a trap composed of 135 places in 550 ms of which 10 ms to minimize.
[2024-06-01 16:44:25] [INFO ] Deduced a trap composed of 224 places in 520 ms of which 8 ms to minimize.
[2024-06-01 16:44:26] [INFO ] Deduced a trap composed of 194 places in 547 ms of which 13 ms to minimize.
[2024-06-01 16:44:26] [INFO ] Deduced a trap composed of 270 places in 577 ms of which 7 ms to minimize.
[2024-06-01 16:44:27] [INFO ] Deduced a trap composed of 150 places in 554 ms of which 7 ms to minimize.
[2024-06-01 16:44:27] [INFO ] Deduced a trap composed of 211 places in 559 ms of which 7 ms to minimize.
[2024-06-01 16:44:28] [INFO ] Deduced a trap composed of 163 places in 546 ms of which 6 ms to minimize.
[2024-06-01 16:44:29] [INFO ] Deduced a trap composed of 156 places in 534 ms of which 8 ms to minimize.
[2024-06-01 16:44:29] [INFO ] Deduced a trap composed of 134 places in 527 ms of which 6 ms to minimize.
[2024-06-01 16:44:30] [INFO ] Deduced a trap composed of 150 places in 537 ms of which 7 ms to minimize.
[2024-06-01 16:44:30] [INFO ] Deduced a trap composed of 88 places in 532 ms of which 6 ms to minimize.
[2024-06-01 16:44:31] [INFO ] Deduced a trap composed of 144 places in 485 ms of which 6 ms to minimize.
[2024-06-01 16:44:31] [INFO ] Deduced a trap composed of 163 places in 569 ms of which 7 ms to minimize.
[2024-06-01 16:44:32] [INFO ] Deduced a trap composed of 185 places in 568 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:44:33] [INFO ] Deduced a trap composed of 145 places in 592 ms of which 7 ms to minimize.
[2024-06-01 16:44:33] [INFO ] Deduced a trap composed of 141 places in 621 ms of which 7 ms to minimize.
[2024-06-01 16:44:34] [INFO ] Deduced a trap composed of 100 places in 594 ms of which 7 ms to minimize.
[2024-06-01 16:44:34] [INFO ] Deduced a trap composed of 126 places in 614 ms of which 7 ms to minimize.
[2024-06-01 16:44:35] [INFO ] Deduced a trap composed of 117 places in 475 ms of which 6 ms to minimize.
[2024-06-01 16:44:36] [INFO ] Deduced a trap composed of 99 places in 577 ms of which 8 ms to minimize.
[2024-06-01 16:44:36] [INFO ] Deduced a trap composed of 115 places in 519 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 757/1178 variables, 421/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1178 variables, 110/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1178 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1178 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1178 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17421 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 421/421 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 27/27 constraints]
After SMT, in 18246ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 191 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 757/757 transitions.
Applied a total of 0 rules in 74 ms. Remains 421 /421 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 421/421 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 757/757 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2024-06-01 16:44:38] [INFO ] Invariant cache hit.
[2024-06-01 16:44:40] [INFO ] Implicit Places using invariants in 1406 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1411 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/421 places, 757/757 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
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 299 transition count 636
Applied a total of 242 rules in 67 ms. Remains 299 /420 variables (removed 121) and now considering 636/757 (removed 121) transitions.
// Phase 1: matrix 636 rows 299 cols
[2024-06-01 16:44:40] [INFO ] Computed 24 invariants in 7 ms
[2024-06-01 16:44:40] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 16:44:40] [INFO ] Invariant cache hit.
[2024-06-01 16:44:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:44:42] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 299/421 places, 636/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4268 ms. Remains : 299/421 places, 636/757 transitions.
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 403994 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :1 out of 2
Probabilistic random walk after 403994 steps, saw 305990 distinct states, run finished after 3003 ms. (steps per millisecond=134 ) properties seen :1
[2024-06-01 16:44:46] [INFO ] Invariant cache hit.
[2024-06-01 16:44:46] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
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) 10/277 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/298 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 636/935 variables, 299/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/935 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 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: 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) 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) 10/277 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/298 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 636/935 variables, 299/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/935 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/935 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 793 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: 0/0 constraints]
After SMT, in 1246ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 298 transition count 615
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 615
Applied a total of 2 rules in 38 ms. Remains 298 /299 variables (removed 1) and now considering 615/636 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 298/299 places, 615/636 transitions.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 871696 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 871696 steps, saw 648386 distinct states, run finished after 3004 ms. (steps per millisecond=290 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2024-06-01 16:44:50] [INFO ] Computed 24 invariants in 8 ms
[2024-06-01 16:44:50] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
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, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 615/913 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/913 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 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: 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) 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, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:44:51] [INFO ] Deduced a trap composed of 109 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:44:51] [INFO ] Deduced a trap composed of 101 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:44:52] [INFO ] Deduced a trap composed of 110 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:44:52] [INFO ] Deduced a trap composed of 100 places in 433 ms of which 8 ms to minimize.
[2024-06-01 16:44:53] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:44:53] [INFO ] Deduced a trap composed of 115 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:44:53] [INFO ] Deduced a trap composed of 132 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:44:54] [INFO ] Deduced a trap composed of 142 places in 413 ms of which 6 ms to minimize.
[2024-06-01 16:44:54] [INFO ] Deduced a trap composed of 103 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:44:55] [INFO ] Deduced a trap composed of 75 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:44:55] [INFO ] Deduced a trap composed of 88 places in 392 ms of which 6 ms to minimize.
[2024-06-01 16:44:56] [INFO ] Deduced a trap composed of 130 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:44:56] [INFO ] Deduced a trap composed of 101 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:44:56] [INFO ] Deduced a trap composed of 80 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:44:57] [INFO ] Deduced a trap composed of 126 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:44:57] [INFO ] Deduced a trap composed of 100 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:44:58] [INFO ] Deduced a trap composed of 64 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:44:58] [INFO ] Deduced a trap composed of 76 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:44:58] [INFO ] Deduced a trap composed of 97 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:44:59] [INFO ] Deduced a trap composed of 91 places in 399 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:44:59] [INFO ] Deduced a trap composed of 102 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:45:00] [INFO ] Deduced a trap composed of 100 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:45:00] [INFO ] Deduced a trap composed of 59 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:45:00] [INFO ] Deduced a trap composed of 99 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:45:01] [INFO ] Deduced a trap composed of 100 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:45:01] [INFO ] Deduced a trap composed of 88 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:45:02] [INFO ] Deduced a trap composed of 49 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:45:02] [INFO ] Deduced a trap composed of 69 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:45:02] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:45:03] [INFO ] Deduced a trap composed of 55 places in 388 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 615/913 variables, 298/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 110/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/913 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/913 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/913 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 463 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13364 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: 30/30 constraints]
After SMT, in 13729ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 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 29 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 29 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 19 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-06-01 16:45:04] [INFO ] Invariant cache hit.
[2024-06-01 16:45:05] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-06-01 16:45:05] [INFO ] Invariant cache hit.
[2024-06-01 16:45:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:45:07] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
[2024-06-01 16:45:07] [INFO ] Redundant transitions in 62 ms returned []
Running 604 sub problems to find dead transitions.
[2024-06-01 16:45:07] [INFO ] Invariant cache hit.
[2024-06-01 16:45:07] [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-06-01 16:45:17] [INFO ] Deduced a trap composed of 96 places in 378 ms of which 6 ms to minimize.
[2024-06-01 16:45:17] [INFO ] Deduced a trap composed of 113 places in 340 ms of which 3 ms to minimize.
[2024-06-01 16:45:18] [INFO ] Deduced a trap composed of 73 places in 386 ms of which 6 ms to minimize.
[2024-06-01 16:45:18] [INFO ] Deduced a trap composed of 82 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:45:18] [INFO ] Deduced a trap composed of 85 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:45:19] [INFO ] Deduced a trap composed of 87 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:45:19] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:45:20] [INFO ] Deduced a trap composed of 96 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:45:20] [INFO ] Deduced a trap composed of 83 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:45:20] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 6 ms to minimize.
[2024-06-01 16:45:22] [INFO ] Deduced a trap composed of 114 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:45:24] [INFO ] Deduced a trap composed of 72 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:45:25] [INFO ] Deduced a trap composed of 101 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:45:25] [INFO ] Deduced a trap composed of 89 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:45:26] [INFO ] Deduced a trap composed of 82 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:45:26] [INFO ] Deduced a trap composed of 88 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:45:27] [INFO ] Deduced a trap composed of 72 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:45:27] [INFO ] Deduced a trap composed of 80 places in 435 ms of which 5 ms to minimize.
[2024-06-01 16:45:27] [INFO ] Deduced a trap composed of 93 places in 422 ms of which 5 ms to minimize.
[2024-06-01 16:45:28] [INFO ] Deduced a trap composed of 91 places in 422 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 16:45:33] [INFO ] Deduced a trap composed of 84 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:45:34] [INFO ] Deduced a trap composed of 54 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:45:34] [INFO ] Deduced a trap composed of 95 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:45:35] [INFO ] Deduced a trap composed of 101 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:45:35] [INFO ] Deduced a trap composed of 104 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:45:36] [INFO ] Deduced a trap composed of 94 places in 432 ms of which 5 ms to minimize.
[2024-06-01 16:45:36] [INFO ] Deduced a trap composed of 87 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:45:37] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:45:37] [INFO ] Deduced a trap composed of 90 places in 440 ms of which 5 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 80 places in 425 ms of which 6 ms to minimize.
SMT process timed out in 31032ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 31047ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33899 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 1 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 26 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-06-01 16:45:38] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 16:45:38] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:45:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 16:45:38] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 23 ms returned sat
[2024-06-01 16:45:38] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:45:38] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:45:38] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 680 ms.
FORMULA Anderson-PT-11-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-11-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 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 42 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-06-01 16:45:39] [INFO ] Computed 25 invariants in 13 ms
[2024-06-01 16:45:40] [INFO ] Implicit Places using invariants in 1000 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1004 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 1066 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 474 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 546 ms.
Stack based approach found an accepted trace after 159 steps with 0 reset with depth 160 and stack size 160 in 2 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 2199 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 23 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-06-01 16:45:41] [INFO ] Computed 25 invariants in 14 ms
[2024-06-01 16:45:42] [INFO ] Implicit Places using invariants in 1193 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1201 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 1245 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 187 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 400 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-02 finished in 1868 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 52 ms. Remains 532 /546 variables (removed 14) and now considering 888/1182 (removed 294) transitions.
// Phase 1: matrix 888 rows 532 cols
[2024-06-01 16:45:43] [INFO ] Computed 25 invariants in 8 ms
[2024-06-01 16:45:44] [INFO ] Implicit Places using invariants in 1436 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1438 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 19 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 1512 ms. Remains : 531/546 places, 888/1182 transitions.
Stuttering acceptance computed with spot in 509 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 316 ms.
Product exploration explored 100000 steps with 0 reset in 664 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 190 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 140 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 232968 steps, run visited all 1 properties in 991 ms. (steps per millisecond=235 )
Probabilistic random walk after 232968 steps, saw 182967 distinct states, run finished after 998 ms. (steps per millisecond=233 ) 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 217 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 162 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 165 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 24 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2024-06-01 16:45:48] [INFO ] Computed 24 invariants in 32 ms
[2024-06-01 16:45:49] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-06-01 16:45:49] [INFO ] Invariant cache hit.
[2024-06-01 16:45:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:45:54] [INFO ] Implicit Places using invariants and state equation in 5152 ms returned []
Implicit Place search using SMT with State Equation took 6047 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2024-06-01 16:45:54] [INFO ] Invariant cache hit.
[2024-06-01 16:45:54] [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-06-01 16:46:12] [INFO ] Deduced a trap composed of 298 places in 629 ms of which 8 ms to minimize.
[2024-06-01 16:46:13] [INFO ] Deduced a trap composed of 339 places in 611 ms of which 8 ms to minimize.
[2024-06-01 16:46:14] [INFO ] Deduced a trap composed of 167 places in 633 ms of which 9 ms to minimize.
[2024-06-01 16:46:21] [INFO ] Deduced a trap composed of 152 places in 739 ms of which 8 ms to minimize.
[2024-06-01 16:46:22] [INFO ] Deduced a trap composed of 188 places in 707 ms of which 8 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 133 places in 694 ms of which 8 ms to minimize.
[2024-06-01 16:46:26] [INFO ] Deduced a trap composed of 168 places in 709 ms of which 9 ms to minimize.
SMT process timed out in 31673ms, After SMT, problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 31692ms
Finished structural reductions in LTL mode , in 1 iterations and 37773 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 89 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)]
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34212 steps (7 resets) in 91 ms. (371 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 136 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 159 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 244 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 1 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 0 ms
Applied a total of 231 rules in 167 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
[2024-06-01 16:46:28] [INFO ] Redundant transitions in 126 ms returned []
Running 856 sub problems to find dead transitions.
// Phase 1: matrix 867 rows 530 cols
[2024-06-01 16:46:28] [INFO ] Computed 24 invariants in 13 ms
[2024-06-01 16:46:28] [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-06-01 16:46:41] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:46:42] [INFO ] Deduced a trap composed of 13 places in 691 ms of which 9 ms to minimize.
[2024-06-01 16:46:42] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 3 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:46:44] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:46:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:46:46] [INFO ] Deduced a trap composed of 123 places in 658 ms of which 8 ms to minimize.
[2024-06-01 16:46:46] [INFO ] Deduced a trap composed of 121 places in 611 ms of which 7 ms to minimize.
[2024-06-01 16:46:47] [INFO ] Deduced a trap composed of 88 places in 693 ms of which 8 ms to minimize.
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 79 places in 635 ms of which 9 ms to minimize.
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 137 places in 623 ms of which 8 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 106 places in 554 ms of which 5 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 103 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 115 places in 587 ms of which 8 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
[2024-06-01 16:46:55] [INFO ] Deduced a trap composed of 99 places in 684 ms of which 9 ms to minimize.
[2024-06-01 16:46:56] [INFO ] Deduced a trap composed of 119 places in 703 ms of which 8 ms to minimize.
[2024-06-01 16:46:58] [INFO ] Deduced a trap composed of 75 places in 664 ms of which 9 ms to minimize.
[2024-06-01 16:46:59] [INFO ] Deduced a trap composed of 65 places in 580 ms of which 8 ms to minimize.
[2024-06-01 16:46:59] [INFO ] Deduced a trap composed of 66 places in 666 ms of which 9 ms to minimize.
SMT process timed out in 31284ms, After SMT, problems are : Problem set: 229 solved, 627 unsolved
Search for dead transitions found 229 dead transitions in 31303ms
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.6 ms
Discarding 229 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 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 31654 ms. Remains : 301/531 places, 638/888 transitions.
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 41 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
// Phase 1: matrix 867 rows 530 cols
[2024-06-01 16:47:00] [INFO ] Computed 24 invariants in 9 ms
[2024-06-01 16:47:00] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-06-01 16:47:00] [INFO ] Invariant cache hit.
[2024-06-01 16:47:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:47:07] [INFO ] Implicit Places using invariants and state equation in 6195 ms returned []
Implicit Place search using SMT with State Equation took 7080 ms to find 0 implicit places.
Running 856 sub problems to find dead transitions.
[2024-06-01 16:47:07] [INFO ] Invariant cache hit.
[2024-06-01 16:47:07] [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-06-01 16:47:30] [INFO ] Deduced a trap composed of 233 places in 666 ms of which 9 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 104 places in 632 ms of which 8 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 191 places in 626 ms of which 8 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 184 places in 620 ms of which 8 ms to minimize.
[2024-06-01 16:47:37] [INFO ] Deduced a trap composed of 337 places in 646 ms of which 8 ms to minimize.
[2024-06-01 16:47:37] [INFO ] Deduced a trap composed of 113 places in 531 ms of which 5 ms to minimize.
SMT process timed out in 30828ms, After SMT, problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 30839ms
Starting structural reductions in LTL mode, iteration 1 : 530/531 places, 867/888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37962 ms. Remains : 530/531 places, 867/888 transitions.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 114972 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 30 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-06-01 16:47:38] [INFO ] Computed 25 invariants in 8 ms
[2024-06-01 16:47:39] [INFO ] Implicit Places using invariants in 1625 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1626 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 11 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 1674 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Running random walk in product with property : Anderson-PT-11-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 414 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 14 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 2612 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-06-01 16:47:40] [INFO ] Computed 25 invariants in 8 ms
[2024-06-01 16:47:41] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-06-01 16:47:41] [INFO ] Invariant cache hit.
[2024-06-01 16:47:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:47:45] [INFO ] Implicit Places using invariants and state equation in 4221 ms returned []
Implicit Place search using SMT with State Equation took 4820 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2024-06-01 16:47:45] [INFO ] Invariant cache hit.
[2024-06-01 16:47:45] [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-06-01 16:48:05] [INFO ] Deduced a trap composed of 231 places in 622 ms of which 10 ms to minimize.
[2024-06-01 16:48:06] [INFO ] Deduced a trap composed of 209 places in 739 ms of which 9 ms to minimize.
[2024-06-01 16:48:07] [INFO ] Deduced a trap composed of 118 places in 687 ms of which 8 ms to minimize.
[2024-06-01 16:48:07] [INFO ] Deduced a trap composed of 73 places in 707 ms of which 8 ms to minimize.
[2024-06-01 16:48:09] [INFO ] Deduced a trap composed of 87 places in 742 ms of which 8 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 108 places in 732 ms of which 9 ms to minimize.
SMT process timed out in 31433ms, After SMT, problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 31442ms
Starting structural reductions in LTL mode, iteration 1 : 530/546 places, 846/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36288 ms. Remains : 530/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 231 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 433 ms.
Stack based approach found an accepted trace after 4692 steps with 0 reset with depth 4693 and stack size 3521 in 24 ms.
FORMULA Anderson-PT-11-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-07 finished in 36998 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 77 ms. Remains 421 /546 variables (removed 125) and now considering 757/1182 (removed 425) transitions.
// Phase 1: matrix 757 rows 421 cols
[2024-06-01 16:48:17] [INFO ] Computed 25 invariants in 14 ms
[2024-06-01 16:48:19] [INFO ] Implicit Places using invariants in 1384 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1387 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 26 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2024-06-01 16:48:19] [INFO ] Computed 24 invariants in 9 ms
[2024-06-01 16:48:20] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-06-01 16:48:20] [INFO ] Invariant cache hit.
[2024-06-01 16:48:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:48:22] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 2733 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 4224 ms. Remains : 301/546 places, 638/1182 transitions.
Stuttering acceptance computed with spot in 117 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 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 4559 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 24 ms. Remains 530 /546 variables (removed 16) and now considering 846/1182 (removed 336) transitions.
// Phase 1: matrix 846 rows 530 cols
[2024-06-01 16:48:22] [INFO ] Computed 25 invariants in 12 ms
[2024-06-01 16:48:23] [INFO ] Implicit Places using invariants in 1282 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1292 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 20 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 1336 ms. Remains : 529/546 places, 846/1182 transitions.
Stuttering acceptance computed with spot in 167 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 281 ms.
Product exploration explored 100000 steps with 0 reset in 431 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 108 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 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 701535 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 701535 steps, saw 539582 distinct states, run finished after 3005 ms. (steps per millisecond=233 ) properties seen :0
// Phase 1: matrix 846 rows 529 cols
[2024-06-01 16:48:28] [INFO ] Computed 24 invariants in 9 ms
[2024-06-01 16:48:28] [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 991 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 1390 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 2405ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 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 65 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 66 ms. Remains : 298/529 places, 615/846 transitions.
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 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 752018 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 1
Probabilistic random walk after 752018 steps, saw 568274 distinct states, run finished after 3002 ms. (steps per millisecond=250 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2024-06-01 16:48:33] [INFO ] Computed 24 invariants in 7 ms
[2024-06-01 16:48:33] [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-06-01 16:48:34] [INFO ] Deduced a trap composed of 90 places in 416 ms of which 5 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 1070 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 985 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 2075ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 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 16 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 17 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 16 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-06-01 16:48:35] [INFO ] Invariant cache hit.
[2024-06-01 16:48:36] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-06-01 16:48:36] [INFO ] Invariant cache hit.
[2024-06-01 16:48:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:48:38] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2492 ms to find 0 implicit places.
[2024-06-01 16:48:38] [INFO ] Redundant transitions in 6 ms returned []
Running 604 sub problems to find dead transitions.
[2024-06-01 16:48:38] [INFO ] Invariant cache hit.
[2024-06-01 16:48:38] [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-06-01 16:48:48] [INFO ] Deduced a trap composed of 109 places in 358 ms of which 6 ms to minimize.
[2024-06-01 16:48:49] [INFO ] Deduced a trap composed of 77 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:48:49] [INFO ] Deduced a trap composed of 102 places in 433 ms of which 5 ms to minimize.
[2024-06-01 16:48:50] [INFO ] Deduced a trap composed of 78 places in 451 ms of which 5 ms to minimize.
[2024-06-01 16:48:50] [INFO ] Deduced a trap composed of 67 places in 441 ms of which 5 ms to minimize.
[2024-06-01 16:48:51] [INFO ] Deduced a trap composed of 86 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:48:51] [INFO ] Deduced a trap composed of 103 places in 402 ms of which 6 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 110 places in 404 ms of which 6 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 107 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 92 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 99 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 73 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 90 places in 440 ms of which 6 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 66 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 127 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 8 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 114 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 58 places in 378 ms of which 5 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 52 places in 454 ms of which 5 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 49 places in 425 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 98 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 97 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 81 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 78 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 77 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 83 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:49:04] [INFO ] Deduced a trap composed of 75 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:49:04] [INFO ] Deduced a trap composed of 102 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:49:05] [INFO ] Deduced a trap composed of 92 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:49:05] [INFO ] Deduced a trap composed of 101 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:49:05] [INFO ] Deduced a trap composed of 68 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 86 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 65 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 102 places in 437 ms of which 5 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 82 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 125 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 105 places in 390 ms of which 6 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 84 places in 404 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/913 variables, and 64 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30043 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: 40/40 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, 40/64 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 16:49:14] [INFO ] Deduced a trap composed of 130 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 112 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 107 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 102 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 56 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 103 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 103 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 105 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 82 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 106 places in 398 ms of which 4 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 87 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 76 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 64 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 66 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 68 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 92 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 116 places in 374 ms of which 5 ms to minimize.
[2024-06-01 16:49:24] [INFO ] Deduced a trap composed of 103 places in 379 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/84 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 84 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30030 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: 60/60 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63109 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 18 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-06-01 16:49:38] [INFO ] Computed 24 invariants in 5 ms
[2024-06-01 16:49:38] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-06-01 16:49:38] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 23 ms returned sat
[2024-06-01 16:49:38] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:49:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 16:49:39] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2024-06-01 16:49:39] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:49:39] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:49:39] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 603 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 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 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 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 12 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 529 cols
[2024-06-01 16:49:39] [INFO ] Computed 24 invariants in 9 ms
[2024-06-01 16:49:40] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 16:49:40] [INFO ] Invariant cache hit.
[2024-06-01 16:49:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:49:46] [INFO ] Implicit Places using invariants and state equation in 6007 ms returned []
Implicit Place search using SMT with State Equation took 6679 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2024-06-01 16:49:46] [INFO ] Invariant cache hit.
[2024-06-01 16:49:46] [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-06-01 16:50:06] [INFO ] Deduced a trap composed of 278 places in 674 ms of which 9 ms to minimize.
[2024-06-01 16:50:08] [INFO ] Deduced a trap composed of 243 places in 568 ms of which 8 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 168 places in 723 ms of which 9 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 147 places in 672 ms of which 8 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 193 places in 684 ms of which 9 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 123 places in 551 ms of which 8 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 312 places in 676 ms of which 8 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 221 places in 687 ms of which 8 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 202 places in 602 ms of which 8 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 116 places in 693 ms of which 11 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 169 places in 638 ms of which 8 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 106 places in 553 ms of which 7 ms to minimize.
[2024-06-01 16:50:16] [INFO ] Deduced a trap composed of 156 places in 645 ms of which 9 ms to minimize.
[2024-06-01 16:50:16] [INFO ] Deduced a trap composed of 138 places in 586 ms of which 7 ms to minimize.
[2024-06-01 16:50:17] [INFO ] Deduced a trap composed of 102 places in 572 ms of which 7 ms to minimize.
SMT process timed out in 30875ms, After SMT, problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 30891ms
Finished structural reductions in LTL mode , in 1 iterations and 37586 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 95 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 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 733294 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 733294 steps, saw 562564 distinct states, run finished after 3004 ms. (steps per millisecond=244 ) properties seen :0
[2024-06-01 16:50:20] [INFO ] Invariant cache hit.
[2024-06-01 16:50:20] [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 886 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 1442 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 2340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 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 53 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 54 ms. Remains : 298/529 places, 615/846 transitions.
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 744096 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 744096 steps, saw 562517 distinct states, run finished after 3004 ms. (steps per millisecond=247 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2024-06-01 16:50:26] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 16:50:26] [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-06-01 16:50:26] [INFO ] Deduced a trap composed of 90 places in 280 ms of which 5 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 826 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 1022 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 1877ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 15 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 15 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 15 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-06-01 16:50:28] [INFO ] Invariant cache hit.
[2024-06-01 16:50:28] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-06-01 16:50:28] [INFO ] Invariant cache hit.
[2024-06-01 16:50:29] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:50:30] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2024-06-01 16:50:30] [INFO ] Redundant transitions in 6 ms returned []
Running 604 sub problems to find dead transitions.
[2024-06-01 16:50:30] [INFO ] Invariant cache hit.
[2024-06-01 16:50:30] [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-06-01 16:50:41] [INFO ] Deduced a trap composed of 109 places in 454 ms of which 5 ms to minimize.
[2024-06-01 16:50:42] [INFO ] Deduced a trap composed of 77 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:50:42] [INFO ] Deduced a trap composed of 102 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:50:43] [INFO ] Deduced a trap composed of 78 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:50:43] [INFO ] Deduced a trap composed of 67 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:50:44] [INFO ] Deduced a trap composed of 86 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:50:44] [INFO ] Deduced a trap composed of 103 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:50:44] [INFO ] Deduced a trap composed of 110 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:50:45] [INFO ] Deduced a trap composed of 107 places in 403 ms of which 6 ms to minimize.
[2024-06-01 16:50:45] [INFO ] Deduced a trap composed of 92 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:50:46] [INFO ] Deduced a trap composed of 99 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:50:46] [INFO ] Deduced a trap composed of 73 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 90 places in 422 ms of which 5 ms to minimize.
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 66 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:50:48] [INFO ] Deduced a trap composed of 127 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:50:48] [INFO ] Deduced a trap composed of 60 places in 446 ms of which 5 ms to minimize.
[2024-06-01 16:50:49] [INFO ] Deduced a trap composed of 114 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:50:49] [INFO ] Deduced a trap composed of 58 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:50:49] [INFO ] Deduced a trap composed of 52 places in 416 ms of which 3 ms to minimize.
[2024-06-01 16:50:50] [INFO ] Deduced a trap composed of 49 places in 314 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-06-01 16:50:53] [INFO ] Deduced a trap composed of 98 places in 378 ms of which 6 ms to minimize.
[2024-06-01 16:50:54] [INFO ] Deduced a trap composed of 97 places in 422 ms of which 7 ms to minimize.
[2024-06-01 16:50:54] [INFO ] Deduced a trap composed of 81 places in 396 ms of which 6 ms to minimize.
[2024-06-01 16:50:55] [INFO ] Deduced a trap composed of 82 places in 365 ms of which 5 ms to minimize.
[2024-06-01 16:50:55] [INFO ] Deduced a trap composed of 78 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:50:56] [INFO ] Deduced a trap composed of 75 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:50:56] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:50:56] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 5 ms to minimize.
[2024-06-01 16:50:57] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:50:57] [INFO ] Deduced a trap composed of 102 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:50:58] [INFO ] Deduced a trap composed of 92 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:50:58] [INFO ] Deduced a trap composed of 101 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:50:58] [INFO ] Deduced a trap composed of 68 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:50:59] [INFO ] Deduced a trap composed of 86 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:50:59] [INFO ] Deduced a trap composed of 65 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:51:00] [INFO ] Deduced a trap composed of 102 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:51:00] [INFO ] Deduced a trap composed of 82 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:51:01] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:51:01] [INFO ] Deduced a trap composed of 105 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:51:01] [INFO ] Deduced a trap composed of 84 places in 403 ms of which 5 ms to minimize.
SMT process timed out in 30965ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 30977ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33543 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 25 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-06-01 16:51:01] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 16:51:01] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 16:51:01] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 23 ms returned sat
[2024-06-01 16:51:01] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:51:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 16:51:02] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 22 ms returned sat
[2024-06-01 16:51:02] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:51:02] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:51:02] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 722 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 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 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 349 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 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 1 ms
Applied a total of 230 rules in 47 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-06-01 16:51:04] [INFO ] Redundant transitions in 13 ms returned []
Running 835 sub problems to find dead transitions.
// Phase 1: matrix 846 rows 529 cols
[2024-06-01 16:51:04] [INFO ] Computed 24 invariants in 12 ms
[2024-06-01 16:51:04] [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-06-01 16:51:20] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 4 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 24 places in 618 ms of which 8 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 30 places in 569 ms of which 5 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:51:24] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 71 places in 683 ms of which 9 ms to minimize.
[2024-06-01 16:51:28] [INFO ] Deduced a trap composed of 64 places in 641 ms of which 8 ms to minimize.
[2024-06-01 16:51:29] [INFO ] Deduced a trap composed of 55 places in 648 ms of which 8 ms to minimize.
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 120 places in 669 ms of which 8 ms to minimize.
[2024-06-01 16:51:31] [INFO ] Deduced a trap composed of 111 places in 696 ms of which 8 ms to minimize.
[2024-06-01 16:51:32] [INFO ] Deduced a trap composed of 113 places in 783 ms of which 9 ms to minimize.
[2024-06-01 16:51:32] [INFO ] Deduced a trap composed of 91 places in 679 ms of which 9 ms to minimize.
[2024-06-01 16:51:33] [INFO ] Deduced a trap composed of 116 places in 661 ms of which 8 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
(s312 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/1375 variables, and 44 constraints, problems are : Problem set: 230 solved, 605 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 230 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 20/20 constraints. Problems are: Problem set: 230 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/20 constraints. Problems are: Problem set: 230 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 230/529 variables, 13/33 constraints. Problems are: Problem set: 230 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 11/44 constraints. Problems are: Problem set: 230 solved, 605 unsolved
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 115 places in 645 ms of which 9 ms to minimize.
[2024-06-01 16:51:49] [INFO ] Deduced a trap composed of 105 places in 663 ms of which 8 ms to minimize.
[2024-06-01 16:51:50] [INFO ] Deduced a trap composed of 99 places in 743 ms of which 9 ms to minimize.
[2024-06-01 16:51:50] [INFO ] Deduced a trap composed of 103 places in 695 ms of which 8 ms to minimize.
[2024-06-01 16:51:51] [INFO ] Deduced a trap composed of 86 places in 647 ms of which 9 ms to minimize.
[2024-06-01 16:51:52] [INFO ] Deduced a trap composed of 131 places in 701 ms of which 8 ms to minimize.
[2024-06-01 16:51:52] [INFO ] Deduced a trap composed of 100 places in 555 ms of which 7 ms to minimize.
[2024-06-01 16:51:53] [INFO ] Deduced a trap composed of 107 places in 590 ms of which 8 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 94 places in 574 ms of which 8 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 94 places in 689 ms of which 8 ms to minimize.
[2024-06-01 16:51:55] [INFO ] Deduced a trap composed of 112 places in 656 ms of which 8 ms to minimize.
[2024-06-01 16:51:56] [INFO ] Deduced a trap composed of 114 places in 576 ms of which 8 ms to minimize.
[2024-06-01 16:51:56] [INFO ] Deduced a trap composed of 98 places in 706 ms of which 8 ms to minimize.
[2024-06-01 16:51:57] [INFO ] Deduced a trap composed of 104 places in 642 ms of which 8 ms to minimize.
[2024-06-01 16:51:58] [INFO ] Deduced a trap composed of 83 places in 586 ms of which 8 ms to minimize.
[2024-06-01 16:51:58] [INFO ] Deduced a trap composed of 87 places in 635 ms of which 8 ms to minimize.
[2024-06-01 16:51:59] [INFO ] Deduced a trap composed of 79 places in 416 ms of which 7 ms to minimize.
[2024-06-01 16:51:59] [INFO ] Deduced a trap composed of 72 places in 506 ms of which 5 ms to minimize.
[2024-06-01 16:52:00] [INFO ] Deduced a trap composed of 98 places in 646 ms of which 8 ms to minimize.
[2024-06-01 16:52:01] [INFO ] Deduced a trap composed of 100 places in 613 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/64 constraints. Problems are: Problem set: 230 solved, 605 unsolved
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 Int declared 529/1375 variables, and 64 constraints, problems are : Problem set: 230 solved, 605 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 40/40 constraints]
After SMT, in 61092ms problems are : Problem set: 230 solved, 605 unsolved
Search for dead transitions found 230 dead transitions in 61109ms
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 16 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 61196 ms. Remains : 299/529 places, 616/846 transitions.
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 19 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 529 cols
[2024-06-01 16:52:05] [INFO ] Computed 24 invariants in 13 ms
[2024-06-01 16:52:06] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-06-01 16:52:06] [INFO ] Invariant cache hit.
[2024-06-01 16:52:07] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:52:11] [INFO ] Implicit Places using invariants and state equation in 5663 ms returned []
Implicit Place search using SMT with State Equation took 6568 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2024-06-01 16:52:11] [INFO ] Invariant cache hit.
[2024-06-01 16:52:11] [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-06-01 16:52:33] [INFO ] Deduced a trap composed of 278 places in 710 ms of which 8 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 243 places in 664 ms of which 8 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 168 places in 740 ms of which 8 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 147 places in 647 ms of which 9 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 193 places in 703 ms of which 8 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 123 places in 668 ms of which 9 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 312 places in 710 ms of which 8 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 221 places in 727 ms of which 9 ms to minimize.
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 202 places in 695 ms of which 9 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 116 places in 570 ms of which 8 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 169 places in 683 ms of which 8 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 106 places in 664 ms of which 8 ms to minimize.
SMT process timed out in 30981ms, After SMT, problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 30996ms
Finished structural reductions in LTL mode , in 1 iterations and 37587 ms. Remains : 529/529 places, 846/846 transitions.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 260624 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 58 ms. Remains 421 /546 variables (removed 125) and now considering 757/1182 (removed 425) transitions.
// Phase 1: matrix 757 rows 421 cols
[2024-06-01 16:52:43] [INFO ] Computed 25 invariants in 10 ms
[2024-06-01 16:52:44] [INFO ] Implicit Places using invariants in 1389 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1391 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 21 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2024-06-01 16:52:44] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 16:52:45] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-06-01 16:52:45] [INFO ] Invariant cache hit.
[2024-06-01 16:52:45] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:52:47] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 2921 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 4393 ms. Remains : 301/546 places, 638/1182 transitions.
Stuttering acceptance computed with spot in 74 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 204 ms.
Product exploration explored 100000 steps with 0 reset in 239 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 146 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 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 31941 steps (6 resets) in 482 ms. (66 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 332 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 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 105 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 15 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-06-01 16:52:49] [INFO ] Invariant cache hit.
[2024-06-01 16:52:49] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-06-01 16:52:49] [INFO ] Invariant cache hit.
[2024-06-01 16:52:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:52:52] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 3092 ms to find 0 implicit places.
[2024-06-01 16:52:52] [INFO ] Redundant transitions in 7 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-01 16:52:52] [INFO ] Invariant cache hit.
[2024-06-01 16:52:52] [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-06-01 16:53:03] [INFO ] Deduced a trap composed of 87 places in 430 ms of which 5 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 109 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 83 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 85 places in 427 ms of which 5 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 95 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 88 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 88 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 107 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 53 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 6 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 86 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 49 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 63 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 88 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 78 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 89 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 117 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:53:11] [INFO ] Deduced a trap composed of 90 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:53:11] [INFO ] Deduced a trap composed of 57 places in 431 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 124 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 99 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 103 places in 377 ms of which 5 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 105 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 74 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 84 places in 422 ms of which 5 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 92 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 84 places in 430 ms of which 5 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 56 places in 430 ms of which 5 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 73 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 97 places in 447 ms of which 5 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 132 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:53:22] [INFO ] Deduced a trap composed of 142 places in 437 ms of which 5 ms to minimize.
[2024-06-01 16:53:22] [INFO ] Deduced a trap composed of 72 places in 449 ms of which 6 ms to minimize.
SMT process timed out in 30727ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30737ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33860 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 168 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 103 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1125 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 31117 steps (6 resets) in 181 ms. (170 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 335 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 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 305 ms.
Product exploration explored 100000 steps with 0 reset in 352 ms.
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 14 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-06-01 16:53:25] [INFO ] Invariant cache hit.
[2024-06-01 16:53:25] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-01 16:53:25] [INFO ] Invariant cache hit.
[2024-06-01 16:53:26] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:53:27] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2024-06-01 16:53:27] [INFO ] Redundant transitions in 5 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-01 16:53:27] [INFO ] Invariant cache hit.
[2024-06-01 16:53:27] [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-06-01 16:53:38] [INFO ] Deduced a trap composed of 87 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 109 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 85 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 95 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 88 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 88 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 107 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 53 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 86 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 49 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 88 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 78 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 89 places in 315 ms of which 3 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 117 places in 319 ms of which 3 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 57 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-06-01 16:53:45] [INFO ] Deduced a trap composed of 124 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 99 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:53:46] [INFO ] Deduced a trap composed of 105 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:53:48] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:53:48] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:53:48] [INFO ] Deduced a trap composed of 92 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:53:49] [INFO ] Deduced a trap composed of 84 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:53:49] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:53:49] [INFO ] Deduced a trap composed of 81 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 73 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 97 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 132 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 142 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:53:51] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:53:51] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:53:51] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 76 places in 261 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-06-01 16:53:58] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 3 ms to minimize.
SMT process timed out in 30583ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33223 ms. Remains : 301/301 places, 638/638 transitions.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 75448 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-06-01 16:53:58] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 16:53:59] [INFO ] Implicit Places using invariants in 927 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 928 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 12 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2024-06-01 16:53:59] [INFO ] Computed 24 invariants in 6 ms
[2024-06-01 16:53:59] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 16:53:59] [INFO ] Invariant cache hit.
[2024-06-01 16:54:00] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:54:01] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2118 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 3093 ms. Remains : 301/546 places, 638/1182 transitions.
Stuttering acceptance computed with spot in 78 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 33 reset in 224 ms.
Product exploration explored 100000 steps with 33 reset in 235 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 109 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 611 ms. (65 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2024-06-01 16:54:02] [INFO ] Invariant cache hit.
[2024-06-01 16:54:02] [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 22ms 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 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 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 8 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-06-01 16:54:03] [INFO ] Invariant cache hit.
[2024-06-01 16:54:03] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-06-01 16:54:03] [INFO ] Invariant cache hit.
[2024-06-01 16:54:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:54:05] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2024-06-01 16:54:05] [INFO ] Redundant transitions in 4 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-01 16:54:05] [INFO ] Invariant cache hit.
[2024-06-01 16:54:05] [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-06-01 16:54:12] [INFO ] Deduced a trap composed of 75 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:54:12] [INFO ] Deduced a trap composed of 76 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 123 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 112 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 107 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 110 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 91 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 85 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 79 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 93 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 85 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 77 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 92 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:54:18] [INFO ] Deduced a trap composed of 105 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:54:18] [INFO ] Deduced a trap composed of 93 places in 259 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-06-01 16:54:20] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:54:20] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:54:22] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:54:22] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:54:22] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:54:23] [INFO ] Deduced a trap composed of 104 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:54:23] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:54:23] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:54:23] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:54:24] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:54:24] [INFO ] Deduced a trap composed of 85 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:54:24] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:54:25] [INFO ] Deduced a trap composed of 95 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:54:25] [INFO ] Deduced a trap composed of 104 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:54:25] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:54:25] [INFO ] Deduced a trap composed of 89 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:54:26] [INFO ] Deduced a trap composed of 75 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:54:26] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:54:27] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:54:27] [INFO ] Deduced a trap composed of 97 places in 270 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-06-01 16:54:34] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 5 ms to minimize.
[2024-06-01 16:54:34] [INFO ] Deduced a trap composed of 91 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:54:35] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:54:35] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:54:35] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 3 ms to minimize.
SMT process timed out in 30612ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30619ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32929 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 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 19676 steps (3 resets) in 50 ms. (385 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 96 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 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 30 reset in 206 ms.
Product exploration explored 100000 steps with 22 reset in 231 ms.
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-06-01 16:54:36] [INFO ] Invariant cache hit.
[2024-06-01 16:54:37] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 16:54:37] [INFO ] Invariant cache hit.
[2024-06-01 16:54:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:54:39] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
[2024-06-01 16:54:39] [INFO ] Redundant transitions in 4 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-01 16:54:39] [INFO ] Invariant cache hit.
[2024-06-01 16:54:39] [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-06-01 16:54:46] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:54:47] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:54:47] [INFO ] Deduced a trap composed of 112 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:54:47] [INFO ] Deduced a trap composed of 107 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:48] [INFO ] Deduced a trap composed of 70 places in 311 ms of which 3 ms to minimize.
[2024-06-01 16:54:48] [INFO ] Deduced a trap composed of 110 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:54:48] [INFO ] Deduced a trap composed of 71 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 138 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 91 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 85 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 79 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 93 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:54:51] [INFO ] Deduced a trap composed of 85 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:51] [INFO ] Deduced a trap composed of 77 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:54:51] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:54:52] [INFO ] Deduced a trap composed of 105 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:54:52] [INFO ] Deduced a trap composed of 93 places in 253 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-06-01 16:54:53] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:54:54] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:54:55] [INFO ] Deduced a trap composed of 77 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:54:56] [INFO ] Deduced a trap composed of 93 places in 339 ms of which 3 ms to minimize.
[2024-06-01 16:54:56] [INFO ] Deduced a trap composed of 92 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:54:56] [INFO ] Deduced a trap composed of 104 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:54:57] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:54:57] [INFO ] Deduced a trap composed of 113 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:54:57] [INFO ] Deduced a trap composed of 101 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:54:57] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:54:58] [INFO ] Deduced a trap composed of 85 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:54:58] [INFO ] Deduced a trap composed of 121 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:54:58] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:54:59] [INFO ] Deduced a trap composed of 104 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:54:59] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:54:59] [INFO ] Deduced a trap composed of 89 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:55:00] [INFO ] Deduced a trap composed of 75 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:55:00] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:55:01] [INFO ] Deduced a trap composed of 85 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:01] [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-06-01 16:55:08] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:55:09] [INFO ] Deduced a trap composed of 91 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:55:09] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:55:09] [INFO ] Deduced a trap composed of 75 places in 254 ms of which 3 ms to minimize.
SMT process timed out in 30756ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32860 ms. Remains : 301/301 places, 638/638 transitions.
Treatment of property Anderson-PT-11-LTLFireability-15 finished in 71360 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 318 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 37 ms. Remains 422 /546 variables (removed 124) and now considering 778/1182 (removed 404) transitions.
// Phase 1: matrix 778 rows 422 cols
[2024-06-01 16:55:10] [INFO ] Computed 25 invariants in 8 ms
[2024-06-01 16:55:11] [INFO ] Implicit Places using invariants in 845 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 858 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 15 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2024-06-01 16:55:11] [INFO ] Computed 24 invariants in 4 ms
[2024-06-01 16:55:11] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-01 16:55:11] [INFO ] Invariant cache hit.
[2024-06-01 16:55:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:55:13] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2212 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 3125 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 222 ms.
Product exploration explored 100000 steps with 0 reset in 259 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 121 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 117 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 21182 steps (4 resets) in 25 ms. (814 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 141 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 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-06-01 16:55:14] [INFO ] Invariant cache hit.
[2024-06-01 16:55:15] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-06-01 16:55:15] [INFO ] Invariant cache hit.
[2024-06-01 16:55:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:55:16] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
Running 649 sub problems to find dead transitions.
[2024-06-01 16:55:16] [INFO ] Invariant cache hit.
[2024-06-01 16:55:16] [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-06-01 16:55:22] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:55:22] [INFO ] Deduced a trap composed of 116 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 86 places in 363 ms of which 4 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 105 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 100 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 99 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 107 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 84 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 124 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 99 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:55:28] [INFO ] Deduced a trap composed of 126 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:55:28] [INFO ] Deduced a trap composed of 149 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:55:28] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:55:29] [INFO ] Deduced a trap composed of 131 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:55:29] [INFO ] Deduced a trap composed of 106 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:55:29] [INFO ] Deduced a trap composed of 115 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:55:30] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:55:30] [INFO ] Deduced a trap composed of 116 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:55:30] [INFO ] Deduced a trap composed of 109 places in 329 ms of which 3 ms to minimize.
[2024-06-01 16:55:30] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-01 16:55:31] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 99 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 112 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 94 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 107 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 92 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 100 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 118 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 106 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 96 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 107 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 120 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 97 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 97 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:55:38] [INFO ] Deduced a trap composed of 88 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:55:38] [INFO ] Deduced a trap composed of 73 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-01 16:55:44] [INFO ] Deduced a trap composed of 119 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:55:44] [INFO ] Deduced a trap composed of 97 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:55:44] [INFO ] Deduced a trap composed of 94 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:45] [INFO ] Deduced a trap composed of 89 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:55:45] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:55:45] [INFO ] Deduced a trap composed of 80 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:55:46] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:55:46] [INFO ] Deduced a trap composed of 72 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:55:46] [INFO ] Deduced a trap composed of 77 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:55:46] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:55:47] [INFO ] Deduced a trap composed of 129 places in 267 ms of which 4 ms to minimize.
SMT process timed out in 30614ms, After SMT, problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 30621ms
Finished structural reductions in LTL mode , in 1 iterations and 32617 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 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 118 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 27279 steps (5 resets) in 37 ms. (717 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 88 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 112 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 264 ms.
Applying partial POR strategy [true, true, false, false]
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.
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 18 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
[2024-06-01 16:55:48] [INFO ] Redundant transitions in 4 ms returned []
Running 628 sub problems to find dead transitions.
// Phase 1: matrix 639 rows 302 cols
[2024-06-01 16:55:48] [INFO ] Computed 24 invariants in 4 ms
[2024-06-01 16:55:48] [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-06-01 16:55:56] [INFO ] Deduced a trap composed of 116 places in 283 ms of which 3 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 88 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 105 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 103 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 93 places in 336 ms of which 3 ms to minimize.
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 95 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 83 places in 327 ms of which 3 ms to minimize.
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 83 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 75 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 84 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 79 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 79 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 103 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 83 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 87 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 91 places in 237 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 80 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:56:04] [INFO ] Deduced a trap composed of 88 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 60 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 85 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 76 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 92 places in 421 ms of which 12 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 109 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 128 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 115 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 113 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 111 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 106 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 113 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 104 places in 267 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-06-01 16:56:17] [INFO ] Deduced a trap composed of 91 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:56:19] [INFO ] Deduced a trap composed of 94 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:56:19] [INFO ] Deduced a trap composed of 80 places in 276 ms of which 4 ms to minimize.
SMT process timed out in 30672ms, After SMT, problems are : Problem set: 1 solved, 627 unsolved
Search for dead transitions found 1 dead transitions in 30680ms
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 10 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 30720 ms. Remains : 301/303 places, 638/660 transitions.
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-06-01 16:56:19] [INFO ] Computed 24 invariants in 4 ms
[2024-06-01 16:56:19] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-01 16:56:19] [INFO ] Invariant cache hit.
[2024-06-01 16:56:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:56:21] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
Running 628 sub problems to find dead transitions.
[2024-06-01 16:56:21] [INFO ] Invariant cache hit.
[2024-06-01 16:56:21] [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-06-01 16:56:28] [INFO ] Deduced a trap composed of 83 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:56:29] [INFO ] Deduced a trap composed of 87 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:56:29] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:56:29] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:56:30] [INFO ] Deduced a trap composed of 107 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:56:30] [INFO ] Deduced a trap composed of 112 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 111 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 101 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 96 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 63 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 102 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Deduced a trap composed of 110 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Deduced a trap composed of 101 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Deduced a trap composed of 95 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:56:34] [INFO ] Deduced a trap composed of 105 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:56:34] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:56:34] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:56:34] [INFO ] Deduced a trap composed of 95 places in 276 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-06-01 16:56:36] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 96 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 82 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 114 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 131 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 123 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 81 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 148 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 99 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 137 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:56:42] [INFO ] Deduced a trap composed of 111 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:56:42] [INFO ] Deduced a trap composed of 104 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:56:42] [INFO ] Deduced a trap composed of 126 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:56:43] [INFO ] Deduced a trap composed of 131 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:56:43] [INFO ] Deduced a trap composed of 126 places in 272 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-06-01 16:56:51] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 75 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 94 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 3 ms to minimize.
SMT process timed out in 30743ms, After SMT, problems are : Problem set: 0 solved, 628 unsolved
Search for dead transitions found 0 dead transitions in 30750ms
Starting structural reductions in LTL mode, iteration 1 : 302/303 places, 639/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32951 ms. Remains : 302/303 places, 639/660 transitions.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 102502 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 116 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 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 36 ms. Remains 420 /546 variables (removed 126) and now considering 736/1182 (removed 446) transitions.
// Phase 1: matrix 736 rows 420 cols
[2024-06-01 16:56:52] [INFO ] Computed 25 invariants in 10 ms
[2024-06-01 16:56:53] [INFO ] Implicit Places using invariants in 945 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 949 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 10 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2024-06-01 16:56:53] [INFO ] Computed 24 invariants in 4 ms
[2024-06-01 16:56:54] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-06-01 16:56:54] [INFO ] Invariant cache hit.
[2024-06-01 16:56:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:56:55] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1818 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 2814 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 217 ms.
Product exploration explored 100000 steps with 0 reset in 240 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 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 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29535 steps (6 resets) in 32 ms. (895 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 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 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 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-06-01 16:56:56] [INFO ] Invariant cache hit.
[2024-06-01 16:56:56] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-06-01 16:56:56] [INFO ] Invariant cache hit.
[2024-06-01 16:56:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:56:58] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-06-01 16:56:58] [INFO ] Invariant cache hit.
[2024-06-01 16:56: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-06-01 16:57:05] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:57:05] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:57:06] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:57:06] [INFO ] Deduced a trap composed of 110 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:57:06] [INFO ] Deduced a trap composed of 83 places in 250 ms of which 6 ms to minimize.
[2024-06-01 16:57:06] [INFO ] Deduced a trap composed of 83 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:57:07] [INFO ] Deduced a trap composed of 88 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:57:07] [INFO ] Deduced a trap composed of 98 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:57:07] [INFO ] Deduced a trap composed of 108 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:57:07] [INFO ] Deduced a trap composed of 100 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:57:08] [INFO ] Deduced a trap composed of 83 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:57:08] [INFO ] Deduced a trap composed of 94 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:57:08] [INFO ] Deduced a trap composed of 101 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:57:08] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:57:09] [INFO ] Deduced a trap composed of 105 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:57:09] [INFO ] Deduced a trap composed of 96 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:57:09] [INFO ] Deduced a trap composed of 118 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:57:10] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 6 ms to minimize.
[2024-06-01 16:57:10] [INFO ] Deduced a trap composed of 105 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:57:10] [INFO ] Deduced a trap composed of 89 places in 262 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-06-01 16:57:13] [INFO ] Deduced a trap composed of 87 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:57:13] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 124 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 93 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 137 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 139 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:57:17] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:57:17] [INFO ] Deduced a trap composed of 133 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:57:17] [INFO ] Deduced a trap composed of 96 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:57:17] [INFO ] Deduced a trap composed of 96 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:57:18] [INFO ] Deduced a trap composed of 94 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:57:18] [INFO ] Deduced a trap composed of 88 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:57:18] [INFO ] Deduced a trap composed of 115 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:57:18] [INFO ] Deduced a trap composed of 120 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:57:19] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:57:19] [INFO ] Deduced a trap composed of 129 places in 218 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-06-01 16:57:26] [INFO ] Deduced a trap composed of 78 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:57:27] [INFO ] Deduced a trap composed of 114 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:57:27] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:57:27] [INFO ] Deduced a trap composed of 103 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:57:28] [INFO ] Deduced a trap composed of 94 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:57:28] [INFO ] Deduced a trap composed of 94 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 299/915 variables, and 70 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/299 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 46/70 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/915 variables, and 70 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/299 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/605 constraints, Known Traps: 46/46 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Finished structural reductions in LTL mode , in 1 iterations and 62469 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 113 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 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34804 steps (7 resets) in 37 ms. (915 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 97 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 p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 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 191 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 109 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 7 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2024-06-01 16:58:00] [INFO ] Redundant transitions in 4 ms returned []
Running 605 sub problems to find dead transitions.
[2024-06-01 16:58:00] [INFO ] Invariant cache hit.
[2024-06-01 16:58:00] [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-06-01 16:58:07] [INFO ] Deduced a trap composed of 80 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:58:07] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 88 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 110 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 83 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:58:09] [INFO ] Deduced a trap composed of 88 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:58:09] [INFO ] Deduced a trap composed of 98 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:58:09] [INFO ] Deduced a trap composed of 108 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 100 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 94 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 101 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:58:11] [INFO ] Deduced a trap composed of 43 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:58:11] [INFO ] Deduced a trap composed of 105 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:58:11] [INFO ] Deduced a trap composed of 96 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:58:11] [INFO ] Deduced a trap composed of 118 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:58:12] [INFO ] Deduced a trap composed of 91 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:58:12] [INFO ] Deduced a trap composed of 105 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:58:12] [INFO ] Deduced a trap composed of 89 places in 259 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-06-01 16:58:15] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:58:15] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:58:16] [INFO ] Deduced a trap composed of 75 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:58:16] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:58:17] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:58:17] [INFO ] Deduced a trap composed of 124 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:58:17] [INFO ] Deduced a trap composed of 73 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:58:18] [INFO ] Deduced a trap composed of 93 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:58:18] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:58:18] [INFO ] Deduced a trap composed of 139 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:58:19] [INFO ] Deduced a trap composed of 123 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:58:19] [INFO ] Deduced a trap composed of 133 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:58:19] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 96 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 94 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 88 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 115 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 120 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 143 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 129 places in 255 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-06-01 16:58:29] [INFO ] Deduced a trap composed of 78 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:58:29] [INFO ] Deduced a trap composed of 114 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:58:30] [INFO ] Deduced a trap composed of 103 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:58:30] [INFO ] Deduced a trap composed of 103 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:58:30] [INFO ] Deduced a trap composed of 94 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:58:30] [INFO ] Deduced a trap composed of 94 places in 267 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 299/915 variables, and 70 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/299 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 46/70 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/915 variables, and 70 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/299 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/605 constraints, Known Traps: 46/46 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60556 ms. Remains : 299/299 places, 616/616 transitions.
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-06-01 16:59:00] [INFO ] Invariant cache hit.
[2024-06-01 16:59:01] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-06-01 16:59:01] [INFO ] Invariant cache hit.
[2024-06-01 16:59:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:59:03] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2395 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-06-01 16:59:03] [INFO ] Invariant cache hit.
[2024-06-01 16:59:03] [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-06-01 16:59:13] [INFO ] Deduced a trap composed of 80 places in 353 ms of which 8 ms to minimize.
[2024-06-01 16:59:13] [INFO ] Deduced a trap composed of 66 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 88 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 110 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 83 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:59:15] [INFO ] Deduced a trap composed of 83 places in 364 ms of which 4 ms to minimize.
[2024-06-01 16:59:15] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:59:15] [INFO ] Deduced a trap composed of 98 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:59:16] [INFO ] Deduced a trap composed of 108 places in 425 ms of which 4 ms to minimize.
[2024-06-01 16:59:16] [INFO ] Deduced a trap composed of 100 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:59:17] [INFO ] Deduced a trap composed of 83 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:59:17] [INFO ] Deduced a trap composed of 94 places in 398 ms of which 4 ms to minimize.
[2024-06-01 16:59:17] [INFO ] Deduced a trap composed of 101 places in 407 ms of which 4 ms to minimize.
[2024-06-01 16:59:18] [INFO ] Deduced a trap composed of 43 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:59:18] [INFO ] Deduced a trap composed of 105 places in 430 ms of which 5 ms to minimize.
[2024-06-01 16:59:19] [INFO ] Deduced a trap composed of 96 places in 400 ms of which 3 ms to minimize.
[2024-06-01 16:59:19] [INFO ] Deduced a trap composed of 118 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:59:20] [INFO ] Deduced a trap composed of 91 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:59:20] [INFO ] Deduced a trap composed of 105 places in 327 ms of which 3 ms to minimize.
[2024-06-01 16:59:21] [INFO ] Deduced a trap composed of 89 places in 317 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-06-01 16:59:24] [INFO ] Deduced a trap composed of 87 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:59:24] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:59:25] [INFO ] Deduced a trap composed of 75 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:59:26] [INFO ] Deduced a trap composed of 54 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:59:26] [INFO ] Deduced a trap composed of 95 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:59:27] [INFO ] Deduced a trap composed of 124 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:59:27] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:59:28] [INFO ] Deduced a trap composed of 93 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:59:28] [INFO ] Deduced a trap composed of 137 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:59:29] [INFO ] Deduced a trap composed of 139 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:59:29] [INFO ] Deduced a trap composed of 123 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:59:30] [INFO ] Deduced a trap composed of 133 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:59:30] [INFO ] Deduced a trap composed of 96 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:59:30] [INFO ] Deduced a trap composed of 96 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:59:31] [INFO ] Deduced a trap composed of 94 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:59:31] [INFO ] Deduced a trap composed of 88 places in 441 ms of which 5 ms to minimize.
[2024-06-01 16:59:32] [INFO ] Deduced a trap composed of 115 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:59:32] [INFO ] Deduced a trap composed of 120 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:59:33] [INFO ] Deduced a trap composed of 143 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:59:33] [INFO ] Deduced a trap composed of 129 places in 411 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 299/915 variables, and 64 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/299 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/915 variables, and 64 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/299 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/605 constraints, Known Traps: 40/40 constraints]
After SMT, in 60791ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60800ms
Finished structural reductions in LTL mode , in 1 iterations and 63202 ms. Remains : 299/299 places, 616/616 transitions.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 191873 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-06-01 17:00:04] [INFO ] Flatten gal took : 92 ms
[2024-06-01 17:00:04] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 17:00:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 546 places, 1182 transitions and 4508 arcs took 19 ms.
Total runtime 1004055 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Anderson-PT-11-LTLFireability-03
Could not compute solution for formula : Anderson-PT-11-LTLFireability-09
Could not compute solution for formula : Anderson-PT-11-LTLFireability-11
Could not compute solution for formula : Anderson-PT-11-LTLFireability-15

BK_STOP 1717261885457

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Anderson-PT-11-LTLFireability-03
ltl formula formula --ltl=/tmp/4220/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 546 places, 1182 transitions and 4508 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.060 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4220/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4220/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4220/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4220/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): There are 547 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 547, there are 1429 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2271 levels ~10000 states ~49512 transitions
pnml2lts-mc( 2/ 4): ~4510 levels ~20000 states ~104396 transitions
pnml2lts-mc( 2/ 4): ~8963 levels ~40000 states ~210660 transitions
pnml2lts-mc( 0/ 4): ~17653 levels ~80000 states ~448172 transitions
pnml2lts-mc( 2/ 4): ~35616 levels ~160000 states ~887336 transitions
pnml2lts-mc( 2/ 4): ~69418 levels ~320000 states ~1797900 transitions
pnml2lts-mc( 2/ 4): ~139903 levels ~640000 states ~3620100 transitions
pnml2lts-mc( 1/ 4): ~275392 levels ~1280000 states ~7374980 transitions
pnml2lts-mc( 2/ 4): ~548763 levels ~2560000 states ~14619940 transitions
pnml2lts-mc( 2/ 4): ~1095291 levels ~5120000 states ~29181492 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6373113
pnml2lts-mc( 0/ 4): unique transitions count: 38245478
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 16251534
pnml2lts-mc( 0/ 4): - claim success count: 6373118
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5530980
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6373118 states 38245616 transitions, fanout: 6.001
pnml2lts-mc( 0/ 4): Total exploration time 183.440 sec (183.390 sec minimum, 183.412 sec on average)
pnml2lts-mc( 0/ 4): States per second: 34742, Transitions per second: 208491
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 144.6MB, 14.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 31.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1212 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 144.6MB (~256.0MB paged-in)
ltl formula name Anderson-PT-11-LTLFireability-09
ltl formula formula --ltl=/tmp/4220/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 546 places, 1182 transitions and 4508 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4220/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4220/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4220/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4220/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 548 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 547, there are 1190 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2202 levels ~10000 states ~57316 transitions
pnml2lts-mc( 3/ 4): ~4222 levels ~20000 states ~117576 transitions
pnml2lts-mc( 3/ 4): ~8460 levels ~40000 states ~218508 transitions
pnml2lts-mc( 3/ 4): ~17060 levels ~80000 states ~431008 transitions
pnml2lts-mc( 3/ 4): ~34585 levels ~160000 states ~880516 transitions
pnml2lts-mc( 3/ 4): ~68800 levels ~320000 states ~1822124 transitions
pnml2lts-mc( 3/ 4): ~137100 levels ~640000 states ~3708424 transitions
pnml2lts-mc( 3/ 4): ~276405 levels ~1280000 states ~7405088 transitions
pnml2lts-mc( 3/ 4): ~550052 levels ~2560000 states ~14880276 transitions
pnml2lts-mc( 3/ 4): ~1096565 levels ~5120000 states ~30053980 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5755061
pnml2lts-mc( 0/ 4): unique transitions count: 35265471
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 13869862
pnml2lts-mc( 0/ 4): - claim success count: 5755067
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5047960
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5755071 states 35265549 transitions, fanout: 6.128
pnml2lts-mc( 0/ 4): Total exploration time 162.440 sec (162.420 sec minimum, 162.430 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35429, Transitions per second: 217099
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.8MB, 14.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1212 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.8MB (~256.0MB paged-in)
ltl formula name Anderson-PT-11-LTLFireability-11
ltl formula formula --ltl=/tmp/4220/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 546 places, 1182 transitions and 4508 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.040 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4220/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4220/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4220/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4220/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 547 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 547, there are 1194 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2273 levels ~10000 states ~23320 transitions
pnml2lts-mc( 0/ 4): ~4389 levels ~20000 states ~52272 transitions
pnml2lts-mc( 0/ 4): ~8609 levels ~40000 states ~107568 transitions
pnml2lts-mc( 3/ 4): ~16871 levels ~80000 states ~223524 transitions
pnml2lts-mc( 3/ 4): ~34233 levels ~160000 states ~449792 transitions
pnml2lts-mc( 3/ 4): ~69098 levels ~320000 states ~925616 transitions
pnml2lts-mc( 3/ 4): ~138052 levels ~640000 states ~1851396 transitions
pnml2lts-mc( 3/ 4): ~278114 levels ~1280000 states ~3799956 transitions
pnml2lts-mc( 3/ 4): ~554117 levels ~2560000 states ~7593456 transitions
pnml2lts-mc( 2/ 4): ~1112074 levels ~5120000 states ~14998344 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 407
pnml2lts-mc( 0/ 4): unique states count: 5972390
pnml2lts-mc( 0/ 4): unique transitions count: 17664874
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 82
pnml2lts-mc( 0/ 4): - claim found count: 6912319
pnml2lts-mc( 0/ 4): - claim success count: 5972393
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5226415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5972393 states 17664908 transitions, fanout: 2.958
pnml2lts-mc( 0/ 4): Total exploration time 164.640 sec (164.610 sec minimum, 164.625 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36275, Transitions per second: 107294
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 140.1MB, 14.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1212 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 140.1MB (~256.0MB paged-in)
ltl formula name Anderson-PT-11-LTLFireability-15
ltl formula formula --ltl=/tmp/4220/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 546 places, 1182 transitions and 4508 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.060 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4220/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4220/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4220/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4220/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 548 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 547, there are 1185 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2226 levels ~10000 states ~27760 transitions
pnml2lts-mc( 0/ 4): ~4468 levels ~20000 states ~61412 transitions
pnml2lts-mc( 2/ 4): ~8809 levels ~40000 states ~113472 transitions
pnml2lts-mc( 2/ 4): ~17859 levels ~80000 states ~240016 transitions
pnml2lts-mc( 2/ 4): ~35787 levels ~160000 states ~448760 transitions
pnml2lts-mc( 2/ 4): ~70098 levels ~320000 states ~896056 transitions
pnml2lts-mc( 2/ 4): ~139806 levels ~640000 states ~1758024 transitions
pnml2lts-mc( 2/ 4): ~279247 levels ~1280000 states ~3581020 transitions
pnml2lts-mc( 0/ 4): ~575883 levels ~2560000 states ~7730544 transitions
pnml2lts-mc( 2/ 4): ~1112793 levels ~5120000 states ~14322784 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3178
pnml2lts-mc( 0/ 4): unique states count: 5987148
pnml2lts-mc( 0/ 4): unique transitions count: 17807162
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 109
pnml2lts-mc( 0/ 4): - claim found count: 6859254
pnml2lts-mc( 0/ 4): - claim success count: 5987152
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5244850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5987152 states 17807209 transitions, fanout: 2.974
pnml2lts-mc( 0/ 4): Total exploration time 166.630 sec (166.610 sec minimum, 166.620 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35931, Transitions per second: 106867
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.7MB, 14.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1212 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r464-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;