About the Execution of LTSMin+red for ShieldIIPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1691.220 | 3600000.00 | 11994423.00 | 2833.40 | ?FF?F?FTFFFT??FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760500155.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 ShieldIIPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 846K May 18 16:43 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 ShieldIIPs-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717231311192
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:41:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:41:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:41:52] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-06-01 08:41:52] [INFO ] Transformed 3003 places.
[2024-06-01 08:41:52] [INFO ] Transformed 2953 transitions.
[2024-06-01 08:41:52] [INFO ] Found NUPN structural information;
[2024-06-01 08:41:52] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 425 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 341 places :
Symmetric choice reduction at 0 with 341 rule applications. Total rules 341 place count 2662 transition count 2612
Iterating global reduction 0 with 341 rules applied. Total rules applied 682 place count 2662 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 683 place count 2661 transition count 2611
Iterating global reduction 0 with 1 rules applied. Total rules applied 684 place count 2661 transition count 2611
Applied a total of 684 rules in 845 ms. Remains 2661 /3003 variables (removed 342) and now considering 2611/2953 (removed 342) transitions.
// Phase 1: matrix 2611 rows 2661 cols
[2024-06-01 08:41:54] [INFO ] Computed 451 invariants in 40 ms
[2024-06-01 08:41:55] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-06-01 08:41:55] [INFO ] Invariant cache hit.
[2024-06-01 08:41:57] [INFO ] Implicit Places using invariants and state equation in 2568 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
Running 2610 sub problems to find dead transitions.
[2024-06-01 08:41:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2660/5272 variables, and 0 constraints, problems are : Problem set: 0 solved, 2610 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2661 constraints, PredecessorRefiner: 2610/2610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2610 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2660/5272 variables, and 0 constraints, problems are : Problem set: 0 solved, 2610 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2661 constraints, PredecessorRefiner: 0/2610 constraints, Known Traps: 0/0 constraints]
After SMT, in 61086ms problems are : Problem set: 0 solved, 2610 unsolved
Search for dead transitions found 0 dead transitions in 61136ms
Starting structural reductions in LTL mode, iteration 1 : 2661/3003 places, 2611/2953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65949 ms. Remains : 2661/3003 places, 2611/2953 transitions.
Support contains 29 out of 2661 places after structural reductions.
[2024-06-01 08:42:59] [INFO ] Flatten gal took : 240 ms
[2024-06-01 08:42:59] [INFO ] Flatten gal took : 163 ms
[2024-06-01 08:42:59] [INFO ] Input system was already deterministic with 2611 transitions.
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 40000 steps (8 resets) in 1769 ms. (22 steps per ms) remains 8/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
[2024-06-01 08:43:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1253/1270 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1270 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1391/2661 variables, 240/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2661 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2611/5272 variables, 2661/3112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5272 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/5272 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5272/5272 variables, and 3112 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2771 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 2661/2661 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1253/1270 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:43:04] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 50 ms to minimize.
[2024-06-01 08:43:04] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 4 ms to minimize.
[2024-06-01 08:43:04] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 4 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 18 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 14 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 6 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 5 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 3 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 3 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 3 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1270 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1270/5272 variables, and 241 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 211/451 constraints, State Equation: 0/2661 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 30/30 constraints]
After SMT, in 7808ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 2661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 247 place count 2661 transition count 2364
Reduce places removed 247 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 249 rules applied. Total rules applied 496 place count 2414 transition count 2362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 498 place count 2412 transition count 2362
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 498 place count 2412 transition count 2112
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 998 place count 2162 transition count 2112
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1003 place count 2157 transition count 2107
Iterating global reduction 3 with 5 rules applied. Total rules applied 1008 place count 2157 transition count 2107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1008 place count 2157 transition count 2105
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1012 place count 2155 transition count 2105
Performed 884 Post agglomeration using F-continuation condition.Transition count delta: 884
Deduced a syphon composed of 884 places in 7 ms
Reduce places removed 884 places and 0 transitions.
Iterating global reduction 3 with 1768 rules applied. Total rules applied 2780 place count 1271 transition count 1221
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 344 times.
Drop transitions (Partial Free agglomeration) removed 344 transitions
Iterating global reduction 3 with 344 rules applied. Total rules applied 3124 place count 1271 transition count 1221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3125 place count 1270 transition count 1220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3126 place count 1269 transition count 1220
Applied a total of 3126 rules in 731 ms. Remains 1269 /2661 variables (removed 1392) and now considering 1220/2611 (removed 1391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 1269/2661 places, 1220/2611 transitions.
RANDOM walk for 40000 steps (8 resets) in 688 ms. (58 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
// Phase 1: matrix 1220 rows 1269 cols
[2024-06-01 08:43:09] [INFO ] Computed 450 invariants in 48 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 561/565 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/592 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/594 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 573/1167 variables, 594/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 5 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 11/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1167 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/1183 variables, 6/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1183 variables, 2/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1183 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 25/1208 variables, 12/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1208 variables, 3/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1208 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1209 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1209 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1209 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1211 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1211 variables, 2/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1211 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 21/1232 variables, 10/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1232 variables, 4/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1232 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 25/1257 variables, 12/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1257 variables, 3/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1257 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/1258 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1258 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1258 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/1260 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1260 variables, 2/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1260 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 21/1281 variables, 10/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1281 variables, 4/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1281 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 25/1306 variables, 12/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1306 variables, 3/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1306 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/1307 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1307 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1307 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/1309 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1309 variables, 2/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1309 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 21/1330 variables, 10/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1330 variables, 4/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1330 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 25/1355 variables, 12/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1355 variables, 3/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1355 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1/1356 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1356 variables, 1/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1356 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/1358 variables, 1/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1358 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1358 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 21/1379 variables, 10/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1379 variables, 4/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1379 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 25/1404 variables, 12/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1404 variables, 3/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1404 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 1/1405 variables, 1/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1405 variables, 1/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1405 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 2/1407 variables, 1/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1407 variables, 2/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1407 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 21/1428 variables, 10/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1428 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1428 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 25/1453 variables, 12/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1453 variables, 3/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1453 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 1/1454 variables, 1/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1454 variables, 1/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1454 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 2/1456 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1456 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1456 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/1478 variables, 10/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1478 variables, 3/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1478 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/1480 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1480 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 9/1489 variables, 4/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1489 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 23/1512 variables, 19/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1512 variables, 2/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1512 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 18/1530 variables, 8/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1530 variables, 3/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1530 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 25/1555 variables, 12/1076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1555 variables, 3/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1555 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 1/1556 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1556 variables, 1/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1556 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 2/1558 variables, 1/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1558 variables, 2/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1558 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 21/1579 variables, 10/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1579 variables, 4/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1579 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 25/1604 variables, 12/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1604 variables, 3/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1604 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 1/1605 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1605 variables, 1/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1605 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 2/1607 variables, 1/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1607 variables, 2/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1607 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 21/1628 variables, 10/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1628 variables, 4/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1628 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 25/1653 variables, 12/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1653 variables, 3/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1653 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 1/1654 variables, 1/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1654 variables, 1/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1654 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 2/1656 variables, 1/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1656 variables, 2/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1656 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 21/1677 variables, 10/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1677 variables, 4/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1677 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 25/1702 variables, 12/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1702 variables, 3/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1702 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 1/1703 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1703 variables, 1/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1703 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 2/1705 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1705 variables, 2/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1705 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 21/1726 variables, 10/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1726 variables, 4/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1726 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 26/1752 variables, 12/1212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1752 variables, 2/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1752 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/1754 variables, 2/1216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1754 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1754 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 2/1756 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1756 variables, 2/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1756 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 21/1777 variables, 10/1231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1777 variables, 4/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1777 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 25/1802 variables, 12/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1802 variables, 3/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1802 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 1/1803 variables, 1/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1803 variables, 1/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1803 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1805 variables, 1/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1805 variables, 2/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1805 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 21/1826 variables, 10/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1826 variables, 4/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1826 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 25/1851 variables, 12/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1851 variables, 3/1284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1851 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 1/1852 variables, 1/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1852 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1852 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (OVERLAPS) 2/1854 variables, 1/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1854 variables, 2/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1854 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (OVERLAPS) 21/1875 variables, 10/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1875 variables, 4/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1875 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (OVERLAPS) 25/1900 variables, 12/1315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1900 variables, 3/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1900 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (OVERLAPS) 1/1901 variables, 1/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1901 variables, 1/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1901 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 2/1903 variables, 1/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1903 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1903 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (OVERLAPS) 21/1924 variables, 10/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1924 variables, 4/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1924 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (OVERLAPS) 25/1949 variables, 12/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1949 variables, 3/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1949 variables, 0/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (OVERLAPS) 1/1950 variables, 1/1353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1950 variables, 1/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1950 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 2/1952 variables, 1/1355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1952 variables, 2/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1952 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 21/1973 variables, 10/1367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1973 variables, 4/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1973 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (OVERLAPS) 25/1998 variables, 12/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1998 variables, 3/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1998 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 1/1999 variables, 1/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1999 variables, 1/1388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1999 variables, 0/1388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (OVERLAPS) 2/2001 variables, 1/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/2001 variables, 2/1391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/2001 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (OVERLAPS) 21/2022 variables, 10/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/2022 variables, 4/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/2022 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (OVERLAPS) 25/2047 variables, 12/1417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/2047 variables, 3/1420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/2047 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 1/2048 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/2048 variables, 1/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/2048 variables, 0/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 2/2050 variables, 1/1423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/2050 variables, 2/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/2050 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (OVERLAPS) 21/2071 variables, 10/1435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/2071 variables, 4/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/2071 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (OVERLAPS) 25/2096 variables, 12/1451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/2096 variables, 3/1454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/2096 variables, 0/1454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 1/2097 variables, 1/1455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/2097 variables, 1/1456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/2097 variables, 0/1456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (OVERLAPS) 2/2099 variables, 1/1457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/2099 variables, 2/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/2099 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (OVERLAPS) 21/2120 variables, 10/1469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/2120 variables, 4/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/2120 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (OVERLAPS) 25/2145 variables, 12/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/2145 variables, 3/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/2145 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 1/2146 variables, 1/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/2146 variables, 1/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/2146 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 2/2148 variables, 1/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/2148 variables, 2/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/2148 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (OVERLAPS) 21/2169 variables, 10/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/2169 variables, 4/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/2169 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (OVERLAPS) 25/2194 variables, 12/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/2194 variables, 3/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/2194 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 1/2195 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/2195 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/2195 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 2/2197 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/2197 variables, 2/1527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/2197 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (OVERLAPS) 21/2218 variables, 10/1537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/2218 variables, 4/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/2218 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (OVERLAPS) 25/2243 variables, 12/1553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/2243 variables, 3/1556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/2243 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 1/2244 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/2244 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/2244 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (OVERLAPS) 2/2246 variables, 1/1559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/2246 variables, 2/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/2246 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (OVERLAPS) 21/2267 variables, 10/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/2267 variables, 4/1575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/2267 variables, 0/1575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (OVERLAPS) 25/2292 variables, 12/1587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/2292 variables, 3/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/2292 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (OVERLAPS) 1/2293 variables, 1/1591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/2293 variables, 1/1592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/2293 variables, 0/1592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (OVERLAPS) 2/2295 variables, 1/1593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/2295 variables, 2/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/2295 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (OVERLAPS) 21/2316 variables, 10/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/2316 variables, 4/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/2316 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (OVERLAPS) 25/2341 variables, 12/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/2341 variables, 3/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/2341 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (OVERLAPS) 1/2342 variables, 1/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/2342 variables, 1/1626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/2342 variables, 0/1626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (OVERLAPS) 2/2344 variables, 1/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/2344 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/2344 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (OVERLAPS) 21/2365 variables, 10/1639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/2365 variables, 4/1643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/2365 variables, 0/1643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (OVERLAPS) 25/2390 variables, 12/1655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/2390 variables, 3/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/2390 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 1/2391 variables, 1/1659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/2391 variables, 1/1660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/2391 variables, 0/1660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (OVERLAPS) 2/2393 variables, 1/1661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/2393 variables, 2/1663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/2393 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (OVERLAPS) 21/2414 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/2414 variables, 4/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/2414 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (OVERLAPS) 25/2439 variables, 12/1689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/2439 variables, 3/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/2439 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 1/2440 variables, 1/1693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/2440 variables, 1/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/2440 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (OVERLAPS) 2/2442 variables, 1/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (INCLUDED_ONLY) 0/2442 variables, 2/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/2442 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (OVERLAPS) 21/2463 variables, 10/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/2463 variables, 4/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/2463 variables, 0/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (OVERLAPS) 18/2481 variables, 9/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/2481 variables, 2/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/2481 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 2/2483 variables, 1/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/2483 variables, 2/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/2483 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (OVERLAPS) 1/2484 variables, 1/1726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (INCLUDED_ONLY) 0/2484 variables, 1/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/2484 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (OVERLAPS) 5/2489 variables, 4/1731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (INCLUDED_ONLY) 0/2489 variables, 2/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/2489 variables, 0/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (OVERLAPS) 0/2489 variables, 0/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2489/2489 variables, and 1733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8212 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1269/1269 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 561/565 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 14/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/592 variables, 9/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/594 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 573/1167 variables, 594/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1167 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1167 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1167 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/1183 variables, 6/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1183 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1183 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 25/1208 variables, 12/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1208 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1208 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1209 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1209 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1209 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1211 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1211 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1211 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 21/1232 variables, 10/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1232 variables, 4/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:19] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1232 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1232 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 25/1257 variables, 12/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1257 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1257 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 1/1258 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1258 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1258 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1260 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1260 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1260 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 21/1281 variables, 10/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1281 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:19] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1281 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1281 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 25/1306 variables, 12/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1306 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1306 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/1307 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1307 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1307 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/1309 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1309 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1309 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 21/1330 variables, 10/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1330 variables, 4/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1330 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 25/1355 variables, 12/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1355 variables, 3/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1355 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 1/1356 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1356 variables, 1/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1356 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 2/1358 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1358 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1358 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 21/1379 variables, 10/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1379 variables, 4/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1379 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 25/1404 variables, 12/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1404 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1404 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 1/1405 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1405 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1405 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 2/1407 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1407 variables, 2/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1407 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 21/1428 variables, 10/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1428 variables, 4/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1428 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 25/1453 variables, 12/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1453 variables, 3/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1453 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 1/1454 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1454 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1454 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/1456 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1456 variables, 2/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1456 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/1478 variables, 10/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1478 variables, 3/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1478 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 2/1480 variables, 1/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1480 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 9/1489 variables, 4/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1489 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 23/1512 variables, 19/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1512 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1512 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 18/1530 variables, 8/1069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1530 variables, 3/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1530 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 25/1555 variables, 12/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1555 variables, 3/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1555 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 1/1556 variables, 1/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1556 variables, 1/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1556 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/1558 variables, 1/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1558 variables, 2/1092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1558 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 21/1579 variables, 10/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1579 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1579 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 25/1604 variables, 12/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1604 variables, 3/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1604 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 1/1605 variables, 1/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1605 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1605 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1607 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1607 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1607 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 21/1628 variables, 10/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1628 variables, 4/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1628 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 25/1653 variables, 12/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1653 variables, 3/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1653 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 1/1654 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1654 variables, 1/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1654 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/1656 variables, 1/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1656 variables, 2/1160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1656 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 21/1677 variables, 10/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1677 variables, 4/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1677 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 25/1702 variables, 12/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1702 variables, 3/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1702 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 1/1703 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1703 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1703 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 2/1705 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1705 variables, 2/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1705 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 21/1726 variables, 10/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1726 variables, 4/1208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1726 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 26/1752 variables, 12/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1752 variables, 2/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1752 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 2/1754 variables, 2/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1754 variables, 2/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1754 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 2/1756 variables, 1/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1756 variables, 2/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1756 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 21/1777 variables, 10/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1777 variables, 4/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1777 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 25/1802 variables, 12/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1802 variables, 3/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1802 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 1/1803 variables, 1/1259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1803 variables, 1/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1803 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 2/1805 variables, 1/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1805 variables, 2/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1805 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 21/1826 variables, 10/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1826 variables, 4/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1826 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 25/1851 variables, 12/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1851 variables, 3/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1851 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 1/1852 variables, 1/1293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1852 variables, 1/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1852 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 2/1854 variables, 1/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1854 variables, 2/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1854 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 21/1875 variables, 10/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1875 variables, 4/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1875 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 25/1900 variables, 12/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1900 variables, 3/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1900 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 1/1901 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1901 variables, 1/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1901 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 2/1903 variables, 1/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1903 variables, 2/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1903 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (OVERLAPS) 21/1924 variables, 10/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1924 variables, 4/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1924 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (OVERLAPS) 25/1949 variables, 12/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1949 variables, 3/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1949 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (OVERLAPS) 1/1950 variables, 1/1361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1950 variables, 1/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1950 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (OVERLAPS) 2/1952 variables, 1/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1952 variables, 2/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1952 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (OVERLAPS) 21/1973 variables, 10/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1973 variables, 4/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1973 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (OVERLAPS) 25/1998 variables, 12/1391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1998 variables, 3/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1998 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 1/1999 variables, 1/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1999 variables, 1/1396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1999 variables, 0/1396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 2/2001 variables, 1/1397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/2001 variables, 2/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/2001 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (OVERLAPS) 21/2022 variables, 10/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/2022 variables, 4/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/2022 variables, 0/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (OVERLAPS) 25/2047 variables, 12/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/2047 variables, 3/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/2047 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (OVERLAPS) 1/2048 variables, 1/1429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/2048 variables, 1/1430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/2048 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (OVERLAPS) 2/2050 variables, 1/1431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/2050 variables, 2/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/2050 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (OVERLAPS) 21/2071 variables, 10/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/2071 variables, 4/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/2071 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (OVERLAPS) 25/2096 variables, 12/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/2096 variables, 3/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/2096 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 1/2097 variables, 1/1463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/2097 variables, 1/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/2097 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (OVERLAPS) 2/2099 variables, 1/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/2099 variables, 2/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/2099 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (OVERLAPS) 21/2120 variables, 10/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/2120 variables, 4/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/2120 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (OVERLAPS) 25/2145 variables, 12/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/2145 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/2145 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 1/2146 variables, 1/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/2146 variables, 1/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/2146 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 2/2148 variables, 1/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/2148 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/2148 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (OVERLAPS) 21/2169 variables, 10/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/2169 variables, 4/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/2169 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (OVERLAPS) 25/2194 variables, 12/1527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/2194 variables, 3/1530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/2194 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (OVERLAPS) 1/2195 variables, 1/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/2195 variables, 1/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/2195 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (OVERLAPS) 2/2197 variables, 1/1533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/2197 variables, 2/1535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/2197 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (OVERLAPS) 21/2218 variables, 10/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/2218 variables, 4/1549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/2218 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (OVERLAPS) 25/2243 variables, 12/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/2243 variables, 3/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/2243 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 1/2244 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/2244 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/2244 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (OVERLAPS) 2/2246 variables, 1/1567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/2246 variables, 2/1569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/2246 variables, 0/1569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 21/2267 variables, 10/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/2267 variables, 4/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/2267 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (OVERLAPS) 25/2292 variables, 12/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/2292 variables, 3/1598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/2292 variables, 0/1598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (OVERLAPS) 1/2293 variables, 1/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/2293 variables, 1/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/2293 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (OVERLAPS) 2/2295 variables, 1/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/2295 variables, 2/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/2295 variables, 0/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (OVERLAPS) 21/2316 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/2316 variables, 4/1617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/2316 variables, 0/1617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (OVERLAPS) 25/2341 variables, 12/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/2341 variables, 3/1632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/2341 variables, 0/1632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 1/2342 variables, 1/1633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/2342 variables, 1/1634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/2342 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (OVERLAPS) 2/2344 variables, 1/1635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/2344 variables, 2/1637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/2344 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (OVERLAPS) 21/2365 variables, 10/1647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/2365 variables, 4/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/2365 variables, 0/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (OVERLAPS) 25/2390 variables, 12/1663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/2390 variables, 3/1666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/2390 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 1/2391 variables, 1/1667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/2391 variables, 1/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/2391 variables, 0/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (OVERLAPS) 2/2393 variables, 1/1669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/2393 variables, 2/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/2393 variables, 0/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (OVERLAPS) 21/2414 variables, 10/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/2414 variables, 4/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (INCLUDED_ONLY) 0/2414 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (OVERLAPS) 25/2439 variables, 12/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/2439 variables, 3/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/2439 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 1/2440 variables, 1/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/2440 variables, 1/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/2440 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (OVERLAPS) 2/2442 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/2442 variables, 2/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/2442 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (OVERLAPS) 21/2463 variables, 10/1715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/2463 variables, 4/1719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/2463 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (OVERLAPS) 18/2481 variables, 9/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/2481 variables, 2/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/2481 variables, 0/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 2/2483 variables, 1/1731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/2483 variables, 2/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/2483 variables, 0/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 1/2484 variables, 1/1734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/2484 variables, 1/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/2484 variables, 0/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (OVERLAPS) 5/2489 variables, 4/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/2489 variables, 2/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/2489 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (OVERLAPS) 0/2489 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2489/2489 variables, and 1741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8071 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1269/1269 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 16341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1145 ms.
Support contains 4 out of 1269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1269/1269 places, 1220/1220 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1269 transition count 1218
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1267 transition count 1218
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 30 place count 1254 transition count 1205
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1254 transition count 1205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 1253 transition count 1204
Applied a total of 33 rules in 269 ms. Remains 1253 /1269 variables (removed 16) and now considering 1204/1220 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1253/1269 places, 1204/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 681 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7858 steps, run visited all 1 properties in 132 ms. (steps per millisecond=59 )
Probabilistic random walk after 7858 steps, saw 7663 distinct states, run finished after 136 ms. (steps per millisecond=57 ) properties seen :1
Computed a total of 603 stabilizing places and 603 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' '!(F((p0||X((!p1 U p2)))))'
Support contains 3 out of 2661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2652 transition count 2602
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2652 transition count 2602
Applied a total of 18 rules in 238 ms. Remains 2652 /2661 variables (removed 9) and now considering 2602/2611 (removed 9) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2024-06-01 08:43:28] [INFO ] Computed 451 invariants in 17 ms
[2024-06-01 08:43:29] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-06-01 08:43:29] [INFO ] Invariant cache hit.
[2024-06-01 08:43:32] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned []
Implicit Place search using SMT with State Equation took 3712 ms to find 0 implicit places.
Running 2601 sub problems to find dead transitions.
[2024-06-01 08:43:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2651/5254 variables, and 0 constraints, problems are : Problem set: 0 solved, 2601 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2652 constraints, PredecessorRefiner: 2601/2601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2601 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2651/5254 variables, and 0 constraints, problems are : Problem set: 0 solved, 2601 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2652 constraints, PredecessorRefiner: 0/2601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60875ms problems are : Problem set: 0 solved, 2601 unsolved
Search for dead transitions found 0 dead transitions in 60903ms
Starting structural reductions in LTL mode, iteration 1 : 2652/2661 places, 2602/2611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64862 ms. Remains : 2652/2661 places, 2602/2611 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-00
Product exploration explored 100000 steps with 77 reset in 734 ms.
Product exploration explored 100000 steps with 77 reset in 745 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/2652 stabilizing places and 599/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 563 ms. (70 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
[2024-06-01 08:44:35] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/109 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2543/2652 variables, 438/451 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2652 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2602/5254 variables, 2652/3103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5254 variables, 0/3103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/5254 variables, 0/3103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5254/5254 variables, and 3103 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 2652/2652 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/109 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2543/2652 variables, 438/451 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 08:44:37] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 4 ms to minimize.
[2024-06-01 08:44:37] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 4 ms to minimize.
[2024-06-01 08:44:38] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-06-01 08:44:38] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-06-01 08:44:38] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 15 ms to minimize.
[2024-06-01 08:44:38] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:44:38] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:44:38] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 3 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 3 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:44:40] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:44:40] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:44:40] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:44:40] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2652 variables, 19/470 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2652 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2602/5254 variables, 2652/3122 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5254 variables, 2/3124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 08:44:41] [INFO ] Deduced a trap composed of 41 places in 526 ms of which 9 ms to minimize.
[2024-06-01 08:44:42] [INFO ] Deduced a trap composed of 31 places in 518 ms of which 9 ms to minimize.
SMT process timed out in 6694ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2652 transition count 2351
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2401 transition count 2351
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2401 transition count 2100
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2150 transition count 2100
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 3 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 2 with 1790 rules applied. Total rules applied 2794 place count 1255 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 347 times.
Drop transitions (Partial Free agglomeration) removed 347 transitions
Iterating global reduction 2 with 347 rules applied. Total rules applied 3141 place count 1255 transition count 1205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3142 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3143 place count 1253 transition count 1204
Applied a total of 3143 rules in 314 ms. Remains 1253 /2652 variables (removed 1399) and now considering 1204/2602 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 1253/2652 places, 1204/2602 transitions.
RANDOM walk for 20008 steps (5 resets) in 337 ms. (59 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:44:43] [INFO ] Invariant cache hit.
[2024-06-01 08:44:45] [INFO ] [Real]Absence check using 451 positive place invariants in 680 ms returned sat
[2024-06-01 08:44:58] [INFO ] [Real]Absence check using state equation in 12956 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2652 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2651 transition count 2350
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2400 transition count 2350
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2400 transition count 2099
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2149 transition count 2099
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2790 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2792 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 1253 transition count 1204
Applied a total of 2793 rules in 407 ms. Remains 1253 /2652 variables (removed 1399) and now considering 1204/2602 (removed 1398) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-06-01 08:44:59] [INFO ] Computed 450 invariants in 8 ms
[2024-06-01 08:44:59] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-06-01 08:44:59] [INFO ] Invariant cache hit.
[2024-06-01 08:45:00] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2024-06-01 08:45:01] [INFO ] Redundant transitions in 271 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-06-01 08:45:01] [INFO ] Computed 450 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:22] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 4 ms to minimize.
[2024-06-01 08:45:23] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 4 ms to minimize.
[2024-06-01 08:45:23] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 4 ms to minimize.
[2024-06-01 08:45:23] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 4 ms to minimize.
[2024-06-01 08:45:23] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 4 ms to minimize.
[2024-06-01 08:45:24] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-06-01 08:45:24] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 5 ms to minimize.
[2024-06-01 08:45:24] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:45:24] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 4 ms to minimize.
[2024-06-01 08:45:25] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 4 ms to minimize.
[2024-06-01 08:45:25] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:45:25] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:45:26] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:45:26] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 4 ms to minimize.
[2024-06-01 08:45:26] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:45:26] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-06-01 08:45:27] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 4 ms to minimize.
[2024-06-01 08:45:27] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:45:27] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 4 ms to minimize.
[2024-06-01 08:45:27] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:28] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-06-01 08:45:28] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:45:28] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-06-01 08:45:28] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 4 ms to minimize.
[2024-06-01 08:45:29] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:45:29] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:45:29] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:45:29] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 08:45:29] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:45:29] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 4 ms to minimize.
[2024-06-01 08:45:30] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:45:30] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:45:30] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:45:30] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:45:30] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:45:30] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:45:31] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:45:31] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1251/2456 variables, and 474 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 436/450 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 38/474 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:32] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:45:32] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:45:32] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:45:32] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:45:32] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:45:32] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:45:33] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1251 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:45:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:45:35] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:45:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:45:35] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:45:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:45:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:45:35] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:45:36] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:45:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:45:36] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:45:36] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-06-01 08:45:36] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:45:37] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:45:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:45:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:45:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1251 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:38] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:45:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:45:39] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:45:39] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:45:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:45:40] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:45:41] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:45:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:45:41] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:45:41] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:45:42] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:45:42] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:45:42] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:45:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:45:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:45:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:45:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:45:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:45:43] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:45:44] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1251 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:44] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:45:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:45:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:45:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:45:46] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 08:45:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:45:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:45:49] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:45:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:45:49] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:45:50] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:45:50] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:45:50] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:45:50] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:45:50] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:45:51] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:45:51] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:45:51] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:45:51] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:45:52] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1251 variables, 20/554 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:45:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:45:55] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:45:56] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 08:45:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:45:59] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:45:59] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:46:00] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:46:00] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:46:00] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:46:00] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:46:01] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1251/2456 variables, and 565 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 436/450 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 129/129 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2652 places, 1203/2602 transitions.
Applied a total of 0 rules in 34 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62790 ms. Remains : 1253/2652 places, 1203/2602 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 152 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 207 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:46:02] [INFO ] Invariant cache hit.
[2024-06-01 08:46:03] [INFO ] [Real]Absence check using 450 positive place invariants in 236 ms returned sat
[2024-06-01 08:46:05] [INFO ] [Real]Absence check using state equation in 2675 ms returned sat
[2024-06-01 08:46:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:46:06] [INFO ] [Nat]Absence check using 450 positive place invariants in 219 ms returned sat
[2024-06-01 08:46:09] [INFO ] [Nat]Absence check using state equation in 2682 ms returned sat
[2024-06-01 08:46:09] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:46:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-06-01 08:46:09] [INFO ] Computed and/alt/rep : 1196/2997/1196 causal constraints (skipped 4 transitions) in 69 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:46:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22673 reset in 849 ms.
Product exploration explored 100000 steps with 22509 reset in 1002 ms.
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1251 transition count 1201
Applied a total of 1 rules in 62 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-06-01 08:46:22] [INFO ] Computed 450 invariants in 7 ms
[2024-06-01 08:46:23] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-06-01 08:46:23] [INFO ] Invariant cache hit.
[2024-06-01 08:46:24] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
[2024-06-01 08:46:24] [INFO ] Redundant transitions in 120 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-06-01 08:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1250 variables, 444/444 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 5 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 5 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 4 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 5 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 5 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 4 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:46:49] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 4 ms to minimize.
[2024-06-01 08:46:49] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-06-01 08:46:49] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:46:49] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 4 ms to minimize.
[2024-06-01 08:46:50] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
[2024-06-01 08:46:50] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 3 ms to minimize.
[2024-06-01 08:46:50] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:46:50] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 3 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1250 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-06-01 08:46:52] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-06-01 08:46:52] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:46:52] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-06-01 08:46:52] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:46:52] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:46:55] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:46:55] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30368ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 30379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/1253 places, 1201/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32414 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-00 finished in 207023 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((p0||G(F((G(p2)||p1))))))'
Support contains 6 out of 2661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2654 transition count 2604
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2654 transition count 2604
Applied a total of 14 rules in 264 ms. Remains 2654 /2661 variables (removed 7) and now considering 2604/2611 (removed 7) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2024-06-01 08:46:55] [INFO ] Computed 451 invariants in 19 ms
[2024-06-01 08:46:56] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-06-01 08:46:56] [INFO ] Invariant cache hit.
[2024-06-01 08:46:59] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 3482 ms to find 0 implicit places.
Running 2603 sub problems to find dead transitions.
[2024-06-01 08:46:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/5258 variables, and 0 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2654 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2653/5258 variables, and 0 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2654 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints]
After SMT, in 60841ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 60865ms
Starting structural reductions in LTL mode, iteration 1 : 2654/2661 places, 2604/2611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64623 ms. Remains : 2654/2661 places, 2604/2611 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-03
Product exploration explored 100000 steps with 20 reset in 926 ms.
Product exploration explored 100000 steps with 20 reset in 1084 ms.
Computed a total of 601 stabilizing places and 601 stable transitions
Computed a total of 601 stabilizing places and 601 stable transitions
Detected a total of 601/2654 stabilizing places and 601/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 146 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 393 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 145129 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :1 out of 4
Probabilistic random walk after 145129 steps, saw 136680 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :1
[2024-06-01 08:48:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2562/2654 variables, 444/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2654 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2604/5258 variables, 2654/3105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5258 variables, 0/3105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/5258 variables, 0/3105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5258/5258 variables, and 3105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 2654/2654 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2562/2654 variables, 444/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 6 ms to minimize.
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 8 ms to minimize.
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 6 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 6 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 5 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 5 ms to minimize.
[2024-06-01 08:48:10] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:48:10] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 5 ms to minimize.
[2024-06-01 08:48:10] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 5 ms to minimize.
[2024-06-01 08:48:10] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:48:11] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 4 ms to minimize.
[2024-06-01 08:48:11] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 4 ms to minimize.
[2024-06-01 08:48:11] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 4 ms to minimize.
[2024-06-01 08:48:11] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 4 ms to minimize.
[2024-06-01 08:48:12] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 4 ms to minimize.
[2024-06-01 08:48:12] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 6579ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2654 transition count 2354
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2404 transition count 2354
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 500 place count 2404 transition count 2104
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1000 place count 2154 transition count 2104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1002 place count 2152 transition count 2102
Iterating global reduction 2 with 2 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1004 place count 2152 transition count 2100
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1008 place count 2150 transition count 2100
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 3 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 2796 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 348 times.
Drop transitions (Partial Free agglomeration) removed 348 transitions
Iterating global reduction 2 with 348 rules applied. Total rules applied 3144 place count 1256 transition count 1206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3145 place count 1255 transition count 1205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3146 place count 1254 transition count 1205
Applied a total of 3146 rules in 462 ms. Remains 1254 /2654 variables (removed 1400) and now considering 1205/2604 (removed 1399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 1254/2654 places, 1205/2604 transitions.
RANDOM walk for 11173 steps (0 resets) in 208 ms. (53 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 10 factoid took 307 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 75 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 2654 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 248 transitions
Trivial Post-agglo rules discarded 248 transitions
Performed 248 trivial Post agglomeration. Transition count delta: 248
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 2653 transition count 2355
Reduce places removed 248 places and 0 transitions.
Iterating post reduction 1 with 248 rules applied. Total rules applied 496 place count 2405 transition count 2355
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 496 place count 2405 transition count 2105
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 996 place count 2155 transition count 2105
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 3 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 2784 place count 1261 transition count 1211
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2786 place count 1259 transition count 1209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2787 place count 1258 transition count 1209
Applied a total of 2787 rules in 301 ms. Remains 1258 /2654 variables (removed 1396) and now considering 1209/2604 (removed 1395) transitions.
// Phase 1: matrix 1209 rows 1258 cols
[2024-06-01 08:48:13] [INFO ] Computed 450 invariants in 5 ms
[2024-06-01 08:48:14] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-06-01 08:48:14] [INFO ] Invariant cache hit.
[2024-06-01 08:48:15] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2024-06-01 08:48:15] [INFO ] Redundant transitions in 177 ms returned [1208]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1202 sub problems to find dead transitions.
// Phase 1: matrix 1208 rows 1258 cols
[2024-06-01 08:48:15] [INFO ] Computed 450 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1253 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:48:37] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 4 ms to minimize.
[2024-06-01 08:48:37] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 4 ms to minimize.
[2024-06-01 08:48:38] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 4 ms to minimize.
[2024-06-01 08:48:38] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 5 ms to minimize.
[2024-06-01 08:48:38] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:48:38] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:48:39] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:48:39] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 4 ms to minimize.
[2024-06-01 08:48:39] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:48:39] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 3 ms to minimize.
[2024-06-01 08:48:40] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:48:40] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-06-01 08:48:40] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-06-01 08:48:40] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
[2024-06-01 08:48:40] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-06-01 08:48:41] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2024-06-01 08:48:41] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-06-01 08:48:41] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:48:41] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:48:41] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1253 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:48:42] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-06-01 08:48:42] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-06-01 08:48:42] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:48:42] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1253 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:48:46] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
SMT process timed out in 30309ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30320ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1258/2654 places, 1208/2604 transitions.
Applied a total of 0 rules in 31 ms. Remains 1258 /1258 variables (removed 0) and now considering 1208/1208 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32525 ms. Remains : 1258/2654 places, 1208/2604 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 7 factoid took 221 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 76 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 11034 steps (1 resets) in 135 ms. (81 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 240 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 67 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 52 reset in 823 ms.
Product exploration explored 100000 steps with 52 reset in 1007 ms.
Support contains 4 out of 1258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1258/1258 places, 1208/1208 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1254 transition count 1204
Applied a total of 2 rules in 58 ms. Remains 1254 /1258 variables (removed 4) and now considering 1204/1208 (removed 4) transitions.
// Phase 1: matrix 1204 rows 1254 cols
[2024-06-01 08:48:48] [INFO ] Computed 450 invariants in 8 ms
[2024-06-01 08:48:49] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-06-01 08:48:49] [INFO ] Invariant cache hit.
[2024-06-01 08:48:50] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
[2024-06-01 08:48:50] [INFO ] Redundant transitions in 131 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 08:48:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:49:12] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 4 ms to minimize.
[2024-06-01 08:49:12] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 4 ms to minimize.
[2024-06-01 08:49:13] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:49:13] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 5 ms to minimize.
[2024-06-01 08:49:13] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:49:13] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 4 ms to minimize.
[2024-06-01 08:49:14] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 4 ms to minimize.
[2024-06-01 08:49:14] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:49:14] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:49:14] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 4 ms to minimize.
[2024-06-01 08:49:15] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-06-01 08:49:15] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 3 ms to minimize.
[2024-06-01 08:49:15] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 4 ms to minimize.
[2024-06-01 08:49:15] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-06-01 08:49:16] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 4 ms to minimize.
[2024-06-01 08:49:16] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-06-01 08:49:16] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-06-01 08:49:16] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 3 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1251 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:49:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
SMT process timed out in 30294ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30304ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1254/1258 places, 1204/1208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32266 ms. Remains : 1254/1258 places, 1204/1208 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-03 finished in 145746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2660 transition count 2360
Reduce places removed 250 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 251 rules applied. Total rules applied 501 place count 2410 transition count 2359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 502 place count 2409 transition count 2359
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 502 place count 2409 transition count 2108
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1004 place count 2158 transition count 2108
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1013 place count 2149 transition count 2099
Iterating global reduction 3 with 9 rules applied. Total rules applied 1022 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1022 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1030 place count 2145 transition count 2095
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 3 with 1786 rules applied. Total rules applied 2816 place count 1252 transition count 1202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2818 place count 1250 transition count 1200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2819 place count 1249 transition count 1200
Applied a total of 2819 rules in 445 ms. Remains 1249 /2661 variables (removed 1412) and now considering 1200/2611 (removed 1411) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-06-01 08:49:21] [INFO ] Computed 450 invariants in 12 ms
[2024-06-01 08:49:22] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-01 08:49:22] [INFO ] Invariant cache hit.
[2024-06-01 08:49:23] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1738 ms to find 0 implicit places.
[2024-06-01 08:49:23] [INFO ] Redundant transitions in 134 ms returned [1199]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-06-01 08:49:23] [INFO ] Computed 450 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 450/450 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 08:49:45] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 4 ms to minimize.
[2024-06-01 08:49:45] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 5 ms to minimize.
[2024-06-01 08:49:46] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 5 ms to minimize.
[2024-06-01 08:49:46] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 4 ms to minimize.
[2024-06-01 08:49:46] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 5 ms to minimize.
[2024-06-01 08:49:47] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 5 ms to minimize.
[2024-06-01 08:49:47] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 5 ms to minimize.
[2024-06-01 08:49:47] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 4 ms to minimize.
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 4 ms to minimize.
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 5 ms to minimize.
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 4 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 4 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 4 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 4 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 08:49:51] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-06-01 08:49:51] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-06-01 08:49:51] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:49:51] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:49:52] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:49:52] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:49:52] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:49:52] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:49:52] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-06-01 08:49:53] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:49:53] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:49:53] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 4 ms to minimize.
[2024-06-01 08:49:53] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:49:53] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:49:53] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 4 ms to minimize.
SMT process timed out in 30443ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 30452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/2661 places, 1199/2611 transitions.
Applied a total of 0 rules in 30 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32814 ms. Remains : 1249/2661 places, 1199/2611 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-05
Product exploration explored 100000 steps with 238 reset in 803 ms.
Product exploration explored 100000 steps with 235 reset in 979 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 : []
Knowledge based reduction with 3 factoid took 78 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1653 steps (0 resets) in 30 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 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 150 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:49:56] [INFO ] Invariant cache hit.
[2024-06-01 08:49:57] [INFO ] [Real]Absence check using 450 positive place invariants in 231 ms returned sat
[2024-06-01 08:50:00] [INFO ] [Real]Absence check using state equation in 2893 ms returned sat
[2024-06-01 08:50:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:50:01] [INFO ] [Nat]Absence check using 450 positive place invariants in 233 ms returned sat
[2024-06-01 08:50:03] [INFO ] [Nat]Absence check using state equation in 2147 ms returned sat
[2024-06-01 08:50:03] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 69 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:50:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 32 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-06-01 08:50:15] [INFO ] Invariant cache hit.
[2024-06-01 08:50:15] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-06-01 08:50:15] [INFO ] Invariant cache hit.
[2024-06-01 08:50:17] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2024-06-01 08:50:17] [INFO ] Redundant transitions in 124 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-06-01 08:50:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 450/450 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 08:50:39] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 5 ms to minimize.
[2024-06-01 08:50:39] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 5 ms to minimize.
[2024-06-01 08:50:39] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 5 ms to minimize.
[2024-06-01 08:50:40] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 5 ms to minimize.
[2024-06-01 08:50:40] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 5 ms to minimize.
[2024-06-01 08:50:40] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 5 ms to minimize.
[2024-06-01 08:50:40] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:50:41] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 4 ms to minimize.
[2024-06-01 08:50:41] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 5 ms to minimize.
[2024-06-01 08:50:41] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 5 ms to minimize.
[2024-06-01 08:50:42] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:50:42] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 4 ms to minimize.
[2024-06-01 08:50:42] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 4 ms to minimize.
[2024-06-01 08:50:42] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 4 ms to minimize.
[2024-06-01 08:50:43] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:50:43] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:50:43] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:50:43] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:50:44] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-06-01 08:50:44] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 08:50:44] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-06-01 08:50:44] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2024-06-01 08:50:45] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:50:45] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 4 ms to minimize.
[2024-06-01 08:50:45] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:50:45] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:50:45] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:50:46] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:50:46] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:50:46] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:50:46] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:50:46] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:50:46] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:50:47] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:50:47] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 08:50:47] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:50:47] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
SMT process timed out in 30329ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 30340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32280 ms. Remains : 1249/1249 places, 1199/1199 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1841 steps (0 resets) in 35 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:50:48] [INFO ] Invariant cache hit.
[2024-06-01 08:50:49] [INFO ] [Real]Absence check using 450 positive place invariants in 228 ms returned sat
[2024-06-01 08:50:52] [INFO ] [Real]Absence check using state equation in 3052 ms returned sat
[2024-06-01 08:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:50:53] [INFO ] [Nat]Absence check using 450 positive place invariants in 240 ms returned sat
[2024-06-01 08:50:55] [INFO ] [Nat]Absence check using state equation in 2343 ms returned sat
[2024-06-01 08:50:55] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 69 ms.
[2024-06-01 08:51:07] [INFO ] Added : 555 causal constraints over 111 iterations in 11567 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 231 reset in 799 ms.
Product exploration explored 100000 steps with 235 reset in 971 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 28 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-06-01 08:51:09] [INFO ] Invariant cache hit.
[2024-06-01 08:51:09] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-06-01 08:51:09] [INFO ] Invariant cache hit.
[2024-06-01 08:51:10] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2024-06-01 08:51:11] [INFO ] Redundant transitions in 129 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-06-01 08:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 450/450 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 08:51:32] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 5 ms to minimize.
[2024-06-01 08:51:33] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 5 ms to minimize.
[2024-06-01 08:51:33] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 4 ms to minimize.
[2024-06-01 08:51:33] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 5 ms to minimize.
[2024-06-01 08:51:33] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 5 ms to minimize.
[2024-06-01 08:51:34] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 5 ms to minimize.
[2024-06-01 08:51:34] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 5 ms to minimize.
[2024-06-01 08:51:34] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:51:35] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:51:35] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 4 ms to minimize.
[2024-06-01 08:51:35] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 5 ms to minimize.
[2024-06-01 08:51:35] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 4 ms to minimize.
[2024-06-01 08:51:36] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:51:36] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 4 ms to minimize.
[2024-06-01 08:51:36] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:51:36] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 08:51:37] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 4 ms to minimize.
[2024-06-01 08:51:37] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:51:37] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 4 ms to minimize.
[2024-06-01 08:51:37] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 08:51:38] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 3 ms to minimize.
[2024-06-01 08:51:38] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-06-01 08:51:38] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 4 ms to minimize.
[2024-06-01 08:51:38] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 4 ms to minimize.
[2024-06-01 08:51:39] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:51:39] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:51:39] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:51:39] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:51:39] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:51:39] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-06-01 08:51:40] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:51:40] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-06-01 08:51:40] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-06-01 08:51:40] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:51:40] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:51:40] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:51:41] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:51:41] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-06-01 08:51:41] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 30272ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 30283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32226 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-05 finished in 140251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)||(X(G((p3||G(p4))))&&p2)))))'
Support contains 6 out of 2661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2654 transition count 2604
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2654 transition count 2604
Applied a total of 14 rules in 263 ms. Remains 2654 /2661 variables (removed 7) and now considering 2604/2611 (removed 7) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2024-06-01 08:51:41] [INFO ] Computed 451 invariants in 21 ms
[2024-06-01 08:51:42] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-06-01 08:51:42] [INFO ] Invariant cache hit.
[2024-06-01 08:51:45] [INFO ] Implicit Places using invariants and state equation in 2689 ms returned []
Implicit Place search using SMT with State Equation took 3549 ms to find 0 implicit places.
Running 2603 sub problems to find dead transitions.
[2024-06-01 08:51:45] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/5258 variables, and 0 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2654 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2653/5258 variables, and 0 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2654 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints]
After SMT, in 60853ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 60876ms
Starting structural reductions in LTL mode, iteration 1 : 2654/2661 places, 2604/2611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64694 ms. Remains : 2654/2661 places, 2604/2611 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p4) (NOT p3)), (NOT p4), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-08 finished in 65104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p0&&F(p1))))))'
Support contains 2 out of 2661 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2660 transition count 2360
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2410 transition count 2360
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2410 transition count 2109
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2159 transition count 2109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1010 place count 2151 transition count 2101
Iterating global reduction 2 with 8 rules applied. Total rules applied 1018 place count 2151 transition count 2101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1018 place count 2151 transition count 2098
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1024 place count 2148 transition count 2098
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2808 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2810 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2811 place count 1253 transition count 1204
Applied a total of 2811 rules in 444 ms. Remains 1253 /2661 variables (removed 1408) and now considering 1204/2611 (removed 1407) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-06-01 08:52:46] [INFO ] Computed 450 invariants in 2 ms
[2024-06-01 08:52:47] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-01 08:52:47] [INFO ] Invariant cache hit.
[2024-06-01 08:52:48] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2024-06-01 08:52:48] [INFO ] Redundant transitions in 121 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-06-01 08:52:48] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:53:10] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 5 ms to minimize.
[2024-06-01 08:53:11] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 5 ms to minimize.
[2024-06-01 08:53:11] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 4 ms to minimize.
[2024-06-01 08:53:11] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 5 ms to minimize.
[2024-06-01 08:53:11] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 5 ms to minimize.
[2024-06-01 08:53:12] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 6 ms to minimize.
[2024-06-01 08:53:12] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:53:12] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 4 ms to minimize.
[2024-06-01 08:53:13] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:53:13] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:53:13] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 5 ms to minimize.
[2024-06-01 08:53:13] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 4 ms to minimize.
[2024-06-01 08:53:14] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 4 ms to minimize.
[2024-06-01 08:53:14] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 4 ms to minimize.
[2024-06-01 08:53:14] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 3 ms to minimize.
[2024-06-01 08:53:14] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 4 ms to minimize.
[2024-06-01 08:53:15] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-06-01 08:53:15] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 4 ms to minimize.
[2024-06-01 08:53:15] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 4 ms to minimize.
[2024-06-01 08:53:15] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:53:16] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-06-01 08:53:16] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-06-01 08:53:16] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-06-01 08:53:16] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:53:16] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:53:17] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:53:17] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:53:17] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:53:17] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:53:17] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-06-01 08:53:18] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:53:19] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:53:19] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30321ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2661 places, 1203/2611 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32726 ms. Remains : 1253/2661 places, 1203/2611 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-12
Product exploration explored 100000 steps with 40 reset in 865 ms.
Product exploration explored 100000 steps with 41 reset in 1075 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9442 steps (0 resets) in 118 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 36 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-06-01 08:53:21] [INFO ] Invariant cache hit.
[2024-06-01 08:53:22] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-06-01 08:53:22] [INFO ] Invariant cache hit.
[2024-06-01 08:53:23] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-06-01 08:53:23] [INFO ] Redundant transitions in 131 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 08:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:53:45] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 5 ms to minimize.
[2024-06-01 08:53:45] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 5 ms to minimize.
[2024-06-01 08:53:46] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 4 ms to minimize.
[2024-06-01 08:53:46] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 4 ms to minimize.
[2024-06-01 08:53:46] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 4 ms to minimize.
[2024-06-01 08:53:46] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 4 ms to minimize.
[2024-06-01 08:53:47] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 5 ms to minimize.
[2024-06-01 08:53:47] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 4 ms to minimize.
[2024-06-01 08:53:47] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 4 ms to minimize.
[2024-06-01 08:53:48] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:53:48] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 20 ms to minimize.
[2024-06-01 08:53:48] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 5 ms to minimize.
[2024-06-01 08:53:48] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 4 ms to minimize.
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 4 ms to minimize.
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 4 ms to minimize.
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 3 ms to minimize.
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 4 ms to minimize.
[2024-06-01 08:53:50] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 4 ms to minimize.
[2024-06-01 08:53:50] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:53:50] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 4 ms to minimize.
[2024-06-01 08:53:51] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:53:51] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:53:51] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:53:51] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:53:51] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:53:52] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:53:52] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:53:52] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:53:52] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-06-01 08:53:52] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-06-01 08:53:52] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:53:53] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:53:54] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 30288ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32286 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9823 steps (0 resets) in 130 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 40 reset in 881 ms.
Product exploration explored 100000 steps with 41 reset in 1082 ms.
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Applied a total of 2 rules in 36 ms. Remains 1252 /1253 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2024-06-01 08:53:56] [INFO ] Computed 450 invariants in 16 ms
[2024-06-01 08:53:57] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-06-01 08:53:57] [INFO ] Invariant cache hit.
[2024-06-01 08:53:58] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2024-06-01 08:53:58] [INFO ] Redundant transitions in 117 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 08:53:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 444/444 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:54:21] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 5 ms to minimize.
[2024-06-01 08:54:21] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 5 ms to minimize.
[2024-06-01 08:54:21] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 5 ms to minimize.
[2024-06-01 08:54:21] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 5 ms to minimize.
[2024-06-01 08:54:22] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 6 ms to minimize.
[2024-06-01 08:54:22] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 4 ms to minimize.
[2024-06-01 08:54:22] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 4 ms to minimize.
[2024-06-01 08:54:23] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 5 ms to minimize.
[2024-06-01 08:54:23] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:54:23] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:54:23] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-06-01 08:54:24] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 4 ms to minimize.
[2024-06-01 08:54:24] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:54:24] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 4 ms to minimize.
[2024-06-01 08:54:24] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 4 ms to minimize.
[2024-06-01 08:54:25] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:54:25] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-06-01 08:54:25] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-06-01 08:54:25] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-06-01 08:54:26] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 08:54:26] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-06-01 08:54:26] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 4 ms to minimize.
[2024-06-01 08:54:26] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:54:27] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-06-01 08:54:27] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-06-01 08:54:27] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:54:27] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 4 ms to minimize.
[2024-06-01 08:54:27] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 4 ms to minimize.
[2024-06-01 08:54:28] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:54:28] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:54:28] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:54:28] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:54:28] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/1253 places, 1202/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32261 ms. Remains : 1252/1253 places, 1202/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-12 finished in 102443 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 2661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2660 transition count 2360
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2410 transition count 2360
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 500 place count 2410 transition count 2110
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1000 place count 2160 transition count 2110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1008 place count 2152 transition count 2102
Iterating global reduction 2 with 8 rules applied. Total rules applied 1016 place count 2152 transition count 2102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1016 place count 2152 transition count 2098
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1024 place count 2148 transition count 2098
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 3 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 2 with 1782 rules applied. Total rules applied 2806 place count 1257 transition count 1207
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2808 place count 1255 transition count 1205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2809 place count 1254 transition count 1205
Applied a total of 2809 rules in 413 ms. Remains 1254 /2661 variables (removed 1407) and now considering 1205/2611 (removed 1406) transitions.
// Phase 1: matrix 1205 rows 1254 cols
[2024-06-01 08:54:29] [INFO ] Computed 450 invariants in 7 ms
[2024-06-01 08:54:29] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-01 08:54:29] [INFO ] Invariant cache hit.
[2024-06-01 08:54:31] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2024-06-01 08:54:31] [INFO ] Redundant transitions in 128 ms returned []
Running 1202 sub problems to find dead transitions.
[2024-06-01 08:54:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 5 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 5 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 4 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 5 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 4 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 5 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 4 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 3 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 4 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 4 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 3 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 3 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 3 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 4 ms to minimize.
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 4 ms to minimize.
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 4 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 3 ms to minimize.
SMT process timed out in 30257ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1254/2661 places, 1205/2611 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32471 ms. Remains : 1254/2661 places, 1205/2611 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-13
Product exploration explored 100000 steps with 319 reset in 824 ms.
Product exploration explored 100000 steps with 481 reset in 1030 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 08:55:04] [INFO ] Invariant cache hit.
[2024-06-01 08:55:05] [INFO ] [Real]Absence check using 450 positive place invariants in 218 ms returned sat
[2024-06-01 08:55:07] [INFO ] [Real]Absence check using state equation in 2050 ms returned sat
[2024-06-01 08:55:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:55:08] [INFO ] [Nat]Absence check using 450 positive place invariants in 235 ms returned sat
[2024-06-01 08:55:11] [INFO ] [Nat]Absence check using state equation in 2508 ms returned sat
[2024-06-01 08:55:11] [INFO ] Computed and/alt/rep : 1200/3006/1200 causal constraints (skipped 2 transitions) in 71 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:55:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4 out of 1254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-06-01 08:55:22] [INFO ] Invariant cache hit.
[2024-06-01 08:55:23] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-06-01 08:55:23] [INFO ] Invariant cache hit.
[2024-06-01 08:55:24] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2024-06-01 08:55:24] [INFO ] Redundant transitions in 280 ms returned []
Running 1202 sub problems to find dead transitions.
[2024-06-01 08:55:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:55:48] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 5 ms to minimize.
[2024-06-01 08:55:48] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 5 ms to minimize.
[2024-06-01 08:55:48] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 4 ms to minimize.
[2024-06-01 08:55:49] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 4 ms to minimize.
[2024-06-01 08:55:49] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 5 ms to minimize.
[2024-06-01 08:55:49] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 4 ms to minimize.
[2024-06-01 08:55:50] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:55:50] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:55:50] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:55:50] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:55:51] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:55:51] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:55:51] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-06-01 08:55:51] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-06-01 08:55:51] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:55:52] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:55:52] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 3 ms to minimize.
[2024-06-01 08:55:52] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-06-01 08:55:52] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 4 ms to minimize.
[2024-06-01 08:55:53] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:55:53] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-06-01 08:55:53] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 5 ms to minimize.
[2024-06-01 08:55:53] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:55:54] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 08:55:54] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:55:54] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-06-01 08:55:54] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:55:54] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:55:55] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 30394ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32621 ms. Remains : 1254/1254 places, 1205/1205 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2548 steps (1 resets) in 24 ms. (101 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 08:55:55] [INFO ] Invariant cache hit.
[2024-06-01 08:55:57] [INFO ] [Real]Absence check using 450 positive place invariants in 232 ms returned sat
[2024-06-01 08:55:59] [INFO ] [Real]Absence check using state equation in 2208 ms returned sat
[2024-06-01 08:55:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:56:00] [INFO ] [Nat]Absence check using 450 positive place invariants in 220 ms returned sat
[2024-06-01 08:56:02] [INFO ] [Nat]Absence check using state equation in 2291 ms returned sat
[2024-06-01 08:56:02] [INFO ] Computed and/alt/rep : 1200/3006/1200 causal constraints (skipped 2 transitions) in 66 ms.
[2024-06-01 08:56:14] [INFO ] Added : 510 causal constraints over 102 iterations in 11627 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 453 reset in 781 ms.
Product exploration explored 100000 steps with 485 reset in 998 ms.
Support contains 4 out of 1254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 27 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-06-01 08:56:16] [INFO ] Invariant cache hit.
[2024-06-01 08:56:16] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-06-01 08:56:16] [INFO ] Invariant cache hit.
[2024-06-01 08:56:18] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2024-06-01 08:56:18] [INFO ] Redundant transitions in 116 ms returned []
Running 1202 sub problems to find dead transitions.
[2024-06-01 08:56:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:56:40] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 5 ms to minimize.
[2024-06-01 08:56:41] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 5 ms to minimize.
[2024-06-01 08:56:41] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 5 ms to minimize.
[2024-06-01 08:56:41] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 4 ms to minimize.
[2024-06-01 08:56:42] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 4 ms to minimize.
[2024-06-01 08:56:42] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:56:42] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 5 ms to minimize.
[2024-06-01 08:56:42] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 4 ms to minimize.
[2024-06-01 08:56:43] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 4 ms to minimize.
[2024-06-01 08:56:43] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 4 ms to minimize.
[2024-06-01 08:56:43] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 4 ms to minimize.
[2024-06-01 08:56:43] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-06-01 08:56:44] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 4 ms to minimize.
[2024-06-01 08:56:44] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 4 ms to minimize.
[2024-06-01 08:56:44] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-06-01 08:56:44] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-06-01 08:56:45] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-06-01 08:56:45] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 4 ms to minimize.
[2024-06-01 08:56:45] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 4 ms to minimize.
[2024-06-01 08:56:45] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:56:46] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 2 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-06-01 08:56:47] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:56:48] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:56:48] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-06-01 08:56:48] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-06-01 08:56:48] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30327ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32270 ms. Remains : 1254/1254 places, 1205/1205 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-13 finished in 139628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((X((!p2 U (p3||G(!p2))))&&p1)))))'
Support contains 5 out of 2661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2655 transition count 2605
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2655 transition count 2605
Applied a total of 12 rules in 258 ms. Remains 2655 /2661 variables (removed 6) and now considering 2605/2611 (removed 6) transitions.
// Phase 1: matrix 2605 rows 2655 cols
[2024-06-01 08:56:48] [INFO ] Computed 451 invariants in 16 ms
[2024-06-01 08:56:49] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-06-01 08:56:49] [INFO ] Invariant cache hit.
[2024-06-01 08:56:52] [INFO ] Implicit Places using invariants and state equation in 2647 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
Running 2604 sub problems to find dead transitions.
[2024-06-01 08:56:52] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2654/5260 variables, and 0 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2655 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2654/5260 variables, and 0 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2655 constraints, PredecessorRefiner: 0/2604 constraints, Known Traps: 0/0 constraints]
After SMT, in 60855ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 60881ms
Starting structural reductions in LTL mode, iteration 1 : 2655/2661 places, 2605/2611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64661 ms. Remains : 2655/2661 places, 2605/2611 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-14
Stuttering criterion allowed to conclude after 6041 steps with 0 reset in 56 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-14 finished in 64966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2652 transition count 2602
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2652 transition count 2602
Applied a total of 18 rules in 258 ms. Remains 2652 /2661 variables (removed 9) and now considering 2602/2611 (removed 9) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2024-06-01 08:57:53] [INFO ] Computed 451 invariants in 13 ms
[2024-06-01 08:57:54] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-06-01 08:57:54] [INFO ] Invariant cache hit.
[2024-06-01 08:57:57] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 3936 ms to find 0 implicit places.
Running 2601 sub problems to find dead transitions.
[2024-06-01 08:57:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2651/5254 variables, and 0 constraints, problems are : Problem set: 0 solved, 2601 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2652 constraints, PredecessorRefiner: 2601/2601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2601 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2651/5254 variables, and 0 constraints, problems are : Problem set: 0 solved, 2601 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/2652 constraints, PredecessorRefiner: 0/2601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60879ms problems are : Problem set: 0 solved, 2601 unsolved
Search for dead transitions found 0 dead transitions in 60900ms
Starting structural reductions in LTL mode, iteration 1 : 2652/2661 places, 2602/2611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65098 ms. Remains : 2652/2661 places, 2602/2611 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 695 steps with 0 reset in 8 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-15 finished in 65236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((!p1 U p2)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-050B-LTLCardinality-00
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2661 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2661/2661 places, 2611/2611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2660 transition count 2359
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2409 transition count 2359
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2409 transition count 2108
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2158 transition count 2108
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1013 place count 2149 transition count 2099
Iterating global reduction 2 with 9 rules applied. Total rules applied 1022 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1022 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1030 place count 2145 transition count 2095
Performed 889 Post agglomeration using F-continuation condition.Transition count delta: 889
Deduced a syphon composed of 889 places in 3 ms
Reduce places removed 889 places and 0 transitions.
Iterating global reduction 2 with 1778 rules applied. Total rules applied 2808 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2810 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2811 place count 1253 transition count 1204
Applied a total of 2811 rules in 426 ms. Remains 1253 /2661 variables (removed 1408) and now considering 1204/2611 (removed 1407) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-06-01 08:58:59] [INFO ] Computed 450 invariants in 6 ms
[2024-06-01 08:59:00] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-01 08:59:00] [INFO ] Invariant cache hit.
[2024-06-01 08:59:01] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2024-06-01 08:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 5 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 4 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 4 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 5 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 4 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 5 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 3 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 4 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 3 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 4 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 4 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-06-01 08:59:27] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-06-01 08:59:27] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:59:27] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:59:27] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 4 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:59:31] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:59:31] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:59:31] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:59:31] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1251 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1251/2457 variables, and 476 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 436/450 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 40/476 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1251 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1251 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:59:46] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:59:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:59:46] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:59:46] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1251 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:59:51] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1251 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 1)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 1)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 1)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 1)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 1)
(s486 0)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 0)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 1)
(s534 0)
(s535 1)
(s536 0)
(s537 1)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 0)
(s552 0)
(s553 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 0)
(s578 0)
(s579 0)
(s580 1)
(s581 0)
(s582 1)
(s583 0)
(s584 0)
(s585 1)
(s586 0)
(s587 1)
(s588 0)
(s589 1)
(s590 0)
(s591 1)
(s592 0)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 0)
(s604 0)
(s605 1)
(s606 0)
(s607 1)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 0)
(s620 1)
(s621 0)
(s622 1)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 0)
(s628 0)
(s629 0)
(s630 1)
(s631 0)
(s632 1)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 1)
(s638 0)
(s639 1)
(s640 0)
(s641 1)
(s642 0)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 1)
(s648 0)
(s649 0)
(s650 0)
(s651 1)
(s652 0)
(s653 0)
(s654 0)
(s655 1)
(s656 0)
(s657 1)
(s658 0)
(s659 1)
(s660 0)
(s661 0)
(s662 1)
(s663 0)
(s664 1)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 1)
(s671 0)
(s672 1)
(s673 0)
(s674 0)
(s675 0)
(s676 1)
(s677 0)
(s678 0)
(s679 0)
(s680 1)
(s681 0)
(s682 1)
(s683 0)
(s684 1)
(s685 0)
(s686 0)
(s687 1)
(s688 0)
(s689 1)
(s690 0)
(s691 1)
(s692 0)
(s693 0)
(s694 0)
(s695 1)
(s696 0)
(s697 1)
(s698 0)
(s699 0)
(s700 0)
(s701 1)
(s702 0)
(s703 0)
(s704 0)
(s705 1)
(s706 0)
(s707 1)
(s708 0)
(s709 0)
(s710 1)
(s711 0)
(s712 1)
(s713 0)
(s714 1)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 1)
(s723 0)
(s724 0)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 0)
(s730 1)
(s731 0)
(s732 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1251/2457 variables, and 561 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 436/450 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1201 constraints, Known Traps: 125/125 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1253/2661 places, 1204/2611 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62502 ms. Remains : 1253/2661 places, 1204/2611 transitions.
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-00
Product exploration explored 100000 steps with 22654 reset in 841 ms.
Product exploration explored 100000 steps with 22770 reset in 914 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 326 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (13 resets) in 511 ms. (78 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
[2024-06-01 09:00:04] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/2457 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 4 factoid took 577 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:00:04] [INFO ] Invariant cache hit.
[2024-06-01 09:00:05] [INFO ] [Real]Absence check using 450 positive place invariants in 232 ms returned sat
[2024-06-01 09:00:08] [INFO ] [Real]Absence check using state equation in 2494 ms returned sat
[2024-06-01 09:00:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:00:09] [INFO ] [Nat]Absence check using 450 positive place invariants in 226 ms returned sat
[2024-06-01 09:00:12] [INFO ] [Nat]Absence check using state equation in 3208 ms returned sat
[2024-06-01 09:00:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:00:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:00:12] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:00:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2024-06-01 09:00:13] [INFO ] Computed and/alt/rep : 1197/3002/1197 causal constraints (skipped 4 transitions) in 56 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1204/1204 transitions.
Applied a total of 0 rules in 35 ms. Remains 1253 /1253 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-06-01 09:00:23] [INFO ] Invariant cache hit.
[2024-06-01 09:00:24] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-01 09:00:24] [INFO ] Invariant cache hit.
[2024-06-01 09:00:25] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2024-06-01 09:00:25] [INFO ] Redundant transitions in 138 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-06-01 09:00:25] [INFO ] Computed 450 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 09:00:46] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 4 ms to minimize.
[2024-06-01 09:00:47] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 4 ms to minimize.
[2024-06-01 09:00:47] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 4 ms to minimize.
[2024-06-01 09:00:47] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 4 ms to minimize.
[2024-06-01 09:00:47] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 4 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 4 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 4 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 4 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 4 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 4 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 4 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 4 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 4 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1251 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1251 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
SMT process timed out in 30248ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1203/1204 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32289 ms. Remains : 1253/1253 places, 1203/1204 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 203 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:00:56] [INFO ] Invariant cache hit.
[2024-06-01 09:00:57] [INFO ] [Real]Absence check using 450 positive place invariants in 222 ms returned sat
[2024-06-01 09:01:00] [INFO ] [Real]Absence check using state equation in 2652 ms returned sat
[2024-06-01 09:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:01] [INFO ] [Nat]Absence check using 450 positive place invariants in 224 ms returned sat
[2024-06-01 09:01:03] [INFO ] [Nat]Absence check using state equation in 2658 ms returned sat
[2024-06-01 09:01:04] [INFO ] Computed and/alt/rep : 1196/2997/1196 causal constraints (skipped 4 transitions) in 58 ms.
[2024-06-01 09:01:15] [INFO ] Added : 555 causal constraints over 111 iterations in 11264 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22562 reset in 725 ms.
Product exploration explored 100000 steps with 22594 reset in 908 ms.
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1251 transition count 1201
Applied a total of 1 rules in 55 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-06-01 09:01:17] [INFO ] Computed 450 invariants in 6 ms
[2024-06-01 09:01:17] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-06-01 09:01:17] [INFO ] Invariant cache hit.
[2024-06-01 09:01:18] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2024-06-01 09:01:18] [INFO ] Redundant transitions in 112 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-06-01 09:01:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1250 variables, 444/444 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 5 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 5 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 4 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 5 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 4 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 4 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 4 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 5 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 4 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 4 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 4 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-06-01 09:01:46] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2024-06-01 09:01:46] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1250 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-06-01 09:01:46] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-06-01 09:01:46] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-06-01 09:01:47] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 4 ms to minimize.
[2024-06-01 09:01:47] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 09:01:47] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-06-01 09:01:47] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-06-01 09:01:47] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 30263ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 30273ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/1253 places, 1201/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32250 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-00 finished in 170522 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((p0||G(F((G(p2)||p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p0&&F(p1))))))'
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)))))'
[2024-06-01 09:01:49] [INFO ] Flatten gal took : 85 ms
[2024-06-01 09:01:49] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 09:01:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2661 places, 2611 transitions and 8222 arcs took 19 ms.
Total runtime 1197534 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPs-PT-050B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760500155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;