fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683762000867
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVs-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3501.151 3600000.00 10315036.00 3147.80 ???TFTFTFFFTFFF? 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-171683762000867.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 ShieldRVs-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000867
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 652K 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 ShieldRVs-PT-100A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717272252135

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:04:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:04:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:04:13] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-06-01 20:04:13] [INFO ] Transformed 1403 places.
[2024-06-01 20:04:13] [INFO ] Transformed 1903 transitions.
[2024-06-01 20:04:13] [INFO ] Found NUPN structural information;
[2024-06-01 20:04:13] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-100A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-100A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 151 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:04:14] [INFO ] Computed 401 invariants in 36 ms
[2024-06-01 20:04:14] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-06-01 20:04:14] [INFO ] Invariant cache hit.
[2024-06-01 20:04:16] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2622 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:04:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30067 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 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 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30037 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61213ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61246ms
Finished structural reductions in LTL mode , in 1 iterations and 64050 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Support contains 28 out of 1403 places after structural reductions.
[2024-06-01 20:05:18] [INFO ] Flatten gal took : 244 ms
[2024-06-01 20:05:18] [INFO ] Flatten gal took : 126 ms
[2024-06-01 20:05:18] [INFO ] Input system was already deterministic with 1903 transitions.
RANDOM walk for 40000 steps (28 resets) in 2058 ms. (19 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
[2024-06-01 20:05:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1396/1403 variables, 399/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1396/1804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:05:20] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 32 ms to minimize.
[2024-06-01 20:05:20] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 4 ms to minimize.
[2024-06-01 20:05:20] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:05:20] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 20/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 5100ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 202 times.
Drop transitions (Partial Free agglomeration) removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 204 place count 1402 transition count 1902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 205 place count 1401 transition count 1901
Applied a total of 205 rules in 573 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 1401/1403 places, 1901/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 613 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21163 steps, run visited all 1 properties in 245 ms. (steps per millisecond=86 )
Probabilistic random walk after 21163 steps, saw 20676 distinct states, run finished after 249 ms. (steps per millisecond=84 ) properties seen :1
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 29 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-06-01 20:05:25] [INFO ] Invariant cache hit.
[2024-06-01 20:05:26] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 20:05:26] [INFO ] Invariant cache hit.
[2024-06-01 20:05:28] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:05:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61041ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61061ms
Finished structural reductions in LTL mode , in 1 iterations and 63317 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-00
Product exploration explored 100000 steps with 98 reset in 798 ms.
Product exploration explored 100000 steps with 98 reset in 906 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 97 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:06:31] [INFO ] Computed 401 invariants in 15 ms
[2024-06-01 20:06:32] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-06-01 20:06:32] [INFO ] Invariant cache hit.
[2024-06-01 20:06:33] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2024-06-01 20:06:34] [INFO ] Redundant transitions in 436 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:06:34] [INFO ] Computed 401 invariants in 12 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30028 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30035 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60972ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60988ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 62 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63914 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 99 reset in 734 ms.
Product exploration explored 100000 steps with 98 reset in 920 ms.
Support contains 2 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 50 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:07:37] [INFO ] Invariant cache hit.
[2024-06-01 20:07:38] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-06-01 20:07:38] [INFO ] Invariant cache hit.
[2024-06-01 20:07:39] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
[2024-06-01 20:07:40] [INFO ] Redundant transitions in 314 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:07:40] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30026 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60888ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63632 ms. Remains : 1402/1402 places, 1901/1901 transitions.
Treatment of property ShieldRVs-PT-100A-LTLCardinality-00 finished in 195611 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 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 102 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:08:41] [INFO ] Computed 401 invariants in 5 ms
[2024-06-01 20:08:42] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-06-01 20:08:42] [INFO ] Invariant cache hit.
[2024-06-01 20:08:43] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2024-06-01 20:08:44] [INFO ] Redundant transitions in 436 ms returned [599]
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 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:08:44] [INFO ] Computed 401 invariants in 7 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30668ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30686ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 56 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33558 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-01
Product exploration explored 100000 steps with 84 reset in 732 ms.
Product exploration explored 100000 steps with 85 reset in 866 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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)]
RANDOM walk for 6038 steps (2 resets) in 64 ms. (92 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 92 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 41 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:09:17] [INFO ] Invariant cache hit.
[2024-06-01 20:09:17] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-06-01 20:09:17] [INFO ] Invariant cache hit.
[2024-06-01 20:09:19] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2024-06-01 20:09:19] [INFO ] Redundant transitions in 327 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:09:19] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30609ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30624ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33146 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X 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 15222 steps (9 resets) in 117 ms. (129 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 102 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)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 84 reset in 707 ms.
Product exploration explored 100000 steps with 86 reset in 874 ms.
Support contains 2 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 40 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:09:52] [INFO ] Invariant cache hit.
[2024-06-01 20:09:53] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-06-01 20:09:53] [INFO ] Invariant cache hit.
[2024-06-01 20:09:54] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2024-06-01 20:09:54] [INFO ] Redundant transitions in 314 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:09:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30609ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30624ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33174 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Treatment of property ShieldRVs-PT-100A-LTLCardinality-01 finished in 104239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 72 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:10:25] [INFO ] Computed 401 invariants in 12 ms
[2024-06-01 20:10:26] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-06-01 20:10:26] [INFO ] Invariant cache hit.
[2024-06-01 20:10:27] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2024-06-01 20:10:28] [INFO ] Redundant transitions in 321 ms returned [599]
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 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:10:28] [INFO ] Computed 401 invariants in 12 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30648ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30664ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 41 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33278 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-02
Product exploration explored 100000 steps with 75 reset in 721 ms.
Product exploration explored 100000 steps with 75 reset in 885 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 1914 steps (0 resets) in 21 ms. (87 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 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 45 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:11:00] [INFO ] Invariant cache hit.
[2024-06-01 20:11:01] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-06-01 20:11:01] [INFO ] Invariant cache hit.
[2024-06-01 20:11:03] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2024-06-01 20:11:03] [INFO ] Redundant transitions in 311 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:11:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30610ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33198 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 1818 steps (0 resets) in 26 ms. (67 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 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 75 reset in 703 ms.
Product exploration explored 100000 steps with 75 reset in 863 ms.
Support contains 2 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 39 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:11:36] [INFO ] Invariant cache hit.
[2024-06-01 20:11:36] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 20:11:36] [INFO ] Invariant cache hit.
[2024-06-01 20:11:38] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2024-06-01 20:11:38] [INFO ] Redundant transitions in 310 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:11:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30605ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30620ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33053 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Treatment of property ShieldRVs-PT-100A-LTLCardinality-02 finished in 103464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U p1))))'
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 76 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:12:09] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:12:09] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-06-01 20:12:09] [INFO ] Invariant cache hit.
[2024-06-01 20:12:11] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
[2024-06-01 20:12:11] [INFO ] Redundant transitions in 303 ms returned [599]
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 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:12:11] [INFO ] Computed 401 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30661ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 52 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33254 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-04
Product exploration explored 100000 steps with 75 reset in 731 ms.
Product exploration explored 100000 steps with 75 reset in 890 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 (NOT p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 87 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (28 resets) in 631 ms. (63 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
[2024-06-01 20:12:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/58 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 189/247 variables, 64/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 64/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/255 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 225/480 variables, 88/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 88/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 21/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 14/494 variables, 7/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 14/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 217/711 variables, 84/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/711 variables, 84/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/711 variables, 21/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/711 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 14/725 variables, 7/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/725 variables, 14/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/725 variables, 14/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/725 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 217/942 variables, 84/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/942 variables, 84/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/942 variables, 21/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/942 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 14/956 variables, 7/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/956 variables, 14/862 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/956 variables, 14/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/956 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 213/1169 variables, 84/960 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1169 variables, 84/1044 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1169 variables, 21/1065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1169 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 14/1183 variables, 7/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1183 variables, 14/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1183 variables, 14/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1183 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 172/1355 variables, 72/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1355 variables, 72/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1355 variables, 19/1263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1355 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 10/1365 variables, 5/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1365 variables, 10/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1365 variables, 10/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1365 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 149/1514 variables, 59/1347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1514 variables, 59/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1514 variables, 15/1421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1514 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 10/1524 variables, 5/1426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1524 variables, 10/1436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1524 variables, 10/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1524 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 126/1650 variables, 50/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1650 variables, 50/1546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1650 variables, 13/1559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1650 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 8/1658 variables, 4/1563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1658 variables, 8/1571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1658 variables, 8/1579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1658 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 124/1782 variables, 48/1627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1782 variables, 48/1675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1782 variables, 12/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1782 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 8/1790 variables, 4/1691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1790 variables, 8/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1790 variables, 8/1707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1790 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 124/1914 variables, 48/1755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1914 variables, 48/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1914 variables, 12/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1914 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 8/1922 variables, 4/1819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1922 variables, 8/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1922 variables, 8/1835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1922 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 124/2046 variables, 48/1883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2046 variables, 48/1931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2046 variables, 12/1943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2046 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 8/2054 variables, 4/1947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2054 variables, 8/1955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2054 variables, 8/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2054 variables, 0/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 124/2178 variables, 48/2011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2178 variables, 48/2059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2178 variables, 12/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2178 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 8/2186 variables, 4/2075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2186 variables, 8/2083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2186 variables, 8/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2186 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 120/2306 variables, 48/2139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2306 variables, 48/2187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2306 variables, 12/2199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2306 variables, 0/2199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 8/2314 variables, 4/2203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2314 variables, 8/2211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2314 variables, 8/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2314 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 79/2393 variables, 36/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2393 variables, 36/2291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2393 variables, 10/2301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2393 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 4/2397 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2397 variables, 4/2307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2397 variables, 4/2311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2397 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 62/2459 variables, 24/2335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2459 variables, 24/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2459 variables, 6/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/2459 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/2463 variables, 2/2367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2463 variables, 4/2371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2463 variables, 4/2375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2463 variables, 0/2375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 62/2525 variables, 24/2399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2525 variables, 24/2423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2525 variables, 6/2429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2525 variables, 0/2429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 4/2529 variables, 2/2431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2529 variables, 4/2435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2529 variables, 4/2439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2529 variables, 0/2439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 62/2591 variables, 24/2463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2591 variables, 24/2487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2591 variables, 6/2493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2591 variables, 0/2493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 4/2595 variables, 2/2495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2595 variables, 4/2499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/2595 variables, 4/2503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2595 variables, 0/2503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 62/2657 variables, 24/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/2657 variables, 24/2551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2657 variables, 6/2557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2657 variables, 0/2557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (OVERLAPS) 4/2661 variables, 2/2559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2661 variables, 4/2563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2661 variables, 4/2567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/2661 variables, 0/2567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (OVERLAPS) 62/2723 variables, 24/2591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/2723 variables, 24/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2723 variables, 6/2621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2723 variables, 0/2621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (OVERLAPS) 4/2727 variables, 2/2623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2727 variables, 4/2627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2727 variables, 4/2631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/2727 variables, 0/2631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (OVERLAPS) 62/2789 variables, 24/2655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/2789 variables, 24/2679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/2789 variables, 6/2685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/2789 variables, 0/2685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (OVERLAPS) 4/2793 variables, 2/2687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/2793 variables, 4/2691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/2793 variables, 4/2695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/2793 variables, 0/2695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (OVERLAPS) 62/2855 variables, 24/2719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/2855 variables, 24/2743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/2855 variables, 6/2749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/2855 variables, 0/2749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (OVERLAPS) 4/2859 variables, 2/2751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/2859 variables, 4/2755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/2859 variables, 4/2759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/2859 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (OVERLAPS) 62/2921 variables, 24/2783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/2921 variables, 24/2807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/2921 variables, 6/2813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/2921 variables, 0/2813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (OVERLAPS) 4/2925 variables, 2/2815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/2925 variables, 4/2819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/2925 variables, 4/2823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/2925 variables, 0/2823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (OVERLAPS) 62/2987 variables, 24/2847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/2987 variables, 24/2871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/2987 variables, 6/2877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/2987 variables, 0/2877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (OVERLAPS) 4/2991 variables, 2/2879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/2991 variables, 4/2883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/2991 variables, 4/2887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/2991 variables, 0/2887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (OVERLAPS) 62/3053 variables, 24/2911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/3053 variables, 24/2935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/3053 variables, 6/2941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/3053 variables, 0/2941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (OVERLAPS) 4/3057 variables, 2/2943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/3057 variables, 4/2947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/3057 variables, 4/2951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/3057 variables, 0/2951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (OVERLAPS) 62/3119 variables, 24/2975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/3119 variables, 24/2999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/3119 variables, 6/3005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/3119 variables, 0/3005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (OVERLAPS) 4/3123 variables, 2/3007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/3123 variables, 4/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/3123 variables, 4/3015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/3123 variables, 0/3015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (OVERLAPS) 62/3185 variables, 24/3039 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/3185 variables, 24/3063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/3185 variables, 6/3069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/3185 variables, 0/3069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 211 (OVERLAPS) 4/3189 variables, 2/3071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/3189 variables, 4/3075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/3189 variables, 4/3079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/3189 variables, 0/3079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 215 (OVERLAPS) 62/3251 variables, 24/3103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/3251 variables, 24/3127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/3251 variables, 6/3133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/3251 variables, 0/3133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 219 (OVERLAPS) 4/3255 variables, 2/3135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/3255 variables, 4/3139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/3255 variables, 4/3143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/3255 variables, 0/3143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 223 (OVERLAPS) 42/3297 variables, 22/3165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/3297 variables, 22/3187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/3297 variables, 6/3193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/3297 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 227 (OVERLAPS) 2/3299 variables, 1/3194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/3299 variables, 2/3196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/3299 variables, 2/3198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/3299 variables, 0/3198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 231 (OVERLAPS) 2/3301 variables, 2/3200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/3301 variables, 2/3202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/3301 variables, 1/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/3301 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 235 (OVERLAPS) 0/3301 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 3203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3718 ms.
Refiners :[Domain max(s): 1401/1401 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1401/1401 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/58 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 189/247 variables, 64/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 64/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/255 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 225/480 variables, 88/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 88/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 21/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 14/494 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/494 variables, 14/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/494 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 217/711 variables, 84/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/711 variables, 84/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/711 variables, 21/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:12:48] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/711 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/711 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 14/725 variables, 7/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/725 variables, 14/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/725 variables, 14/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/725 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 217/942 variables, 84/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/942 variables, 84/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/942 variables, 21/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/942 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 14/956 variables, 7/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/956 variables, 14/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/956 variables, 14/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/956 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 213/1169 variables, 84/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1169 variables, 84/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1169 variables, 21/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1169 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 14/1183 variables, 7/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1183 variables, 14/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1183 variables, 14/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1183 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 172/1355 variables, 72/1177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1355 variables, 72/1249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1355 variables, 19/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1355 variables, 1/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1355 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 10/1365 variables, 5/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1365 variables, 10/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1365 variables, 10/1294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1365 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 149/1514 variables, 59/1353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1514 variables, 59/1412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1514 variables, 15/1427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1514 variables, 4/1431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1514 variables, 0/1431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 10/1524 variables, 5/1436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1524 variables, 10/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1524 variables, 10/1456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1524 variables, 0/1456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 126/1650 variables, 50/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1650 variables, 50/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1650 variables, 13/1569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1650 variables, 0/1569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 8/1658 variables, 4/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1658 variables, 8/1581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1658 variables, 8/1589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:50] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/1658 variables, 1/1590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1658 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 124/1782 variables, 48/1638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1782 variables, 48/1686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1782 variables, 12/1698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:50] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1782 variables, 1/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1782 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 8/1790 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1790 variables, 8/1711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1790 variables, 8/1719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1790 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 124/1914 variables, 48/1767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1914 variables, 48/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1914 variables, 12/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:12:50] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 20:12:51] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:12:51] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:12:51] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:12:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:12:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 89 (INCLUDED_ONLY) 0/1914 variables, 7/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1914 variables, 0/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 8/1922 variables, 4/1838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1922 variables, 8/1846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1922 variables, 8/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1922 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 124/2046 variables, 48/1902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2046 variables, 48/1950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2046 variables, 12/1962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:51] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 98 (INCLUDED_ONLY) 0/2046 variables, 1/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2046 variables, 0/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 8/2054 variables, 4/1967 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2054 variables, 8/1975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2054 variables, 8/1983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2054 variables, 0/1983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 124/2178 variables, 48/2031 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2178 variables, 48/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2178 variables, 12/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2178 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 8/2186 variables, 4/2095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2186 variables, 8/2103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2186 variables, 8/2111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/2186 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 120/2306 variables, 48/2159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2306 variables, 48/2207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2306 variables, 12/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2306 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 8/2314 variables, 4/2223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2314 variables, 8/2231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2314 variables, 8/2239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/2314 variables, 0/2239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 79/2393 variables, 36/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2393 variables, 36/2311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/2393 variables, 10/2321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:52] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:12:52] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 123 (INCLUDED_ONLY) 0/2393 variables, 2/2323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:52] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 124 (INCLUDED_ONLY) 0/2393 variables, 1/2324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2393 variables, 0/2324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 4/2397 variables, 2/2326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/2397 variables, 4/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2397 variables, 4/2334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:53] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 129 (INCLUDED_ONLY) 0/2397 variables, 1/2335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2397 variables, 0/2335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 62/2459 variables, 24/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2459 variables, 24/2383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2459 variables, 6/2389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2459 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 4/2463 variables, 2/2391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2463 variables, 4/2395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2463 variables, 4/2399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2463 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 62/2525 variables, 24/2423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2525 variables, 24/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/2525 variables, 6/2453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:12:53] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
SMT process timed out in 8808ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions (Partial Free agglomeration) removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1401 transition count 1900
Applied a total of 201 rules in 96 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1401/1401 places, 1900/1900 transitions.
RANDOM walk for 40000 steps (32 resets) in 440 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 25879 steps, run visited all 2 properties in 483 ms. (steps per millisecond=53 )
Probabilistic random walk after 25879 steps, saw 25342 distinct states, run finished after 484 ms. (steps per millisecond=53 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 (NOT p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 269 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 43 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:12:54] [INFO ] Invariant cache hit.
[2024-06-01 20:12:55] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-06-01 20:12:55] [INFO ] Invariant cache hit.
[2024-06-01 20:12:57] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
[2024-06-01 20:12:57] [INFO ] Redundant transitions in 310 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30630ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33437 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (NOT p0) p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (28 resets) in 421 ms. (94 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
[2024-06-01 20:13:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/58 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 189/247 variables, 64/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 64/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/255 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 225/480 variables, 88/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 88/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 21/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 14/494 variables, 7/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 14/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 217/711 variables, 84/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/711 variables, 84/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/711 variables, 21/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/711 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 14/725 variables, 7/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/725 variables, 14/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/725 variables, 14/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/725 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 217/942 variables, 84/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/942 variables, 84/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/942 variables, 21/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/942 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 14/956 variables, 7/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/956 variables, 14/862 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/956 variables, 14/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/956 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 213/1169 variables, 84/960 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1169 variables, 84/1044 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1169 variables, 21/1065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1169 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 14/1183 variables, 7/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1183 variables, 14/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1183 variables, 14/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1183 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 172/1355 variables, 72/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1355 variables, 72/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1355 variables, 19/1263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1355 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 10/1365 variables, 5/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1365 variables, 10/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1365 variables, 10/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1365 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 149/1514 variables, 59/1347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1514 variables, 59/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1514 variables, 15/1421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1514 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 10/1524 variables, 5/1426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1524 variables, 10/1436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1524 variables, 10/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1524 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 126/1650 variables, 50/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1650 variables, 50/1546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1650 variables, 13/1559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1650 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 8/1658 variables, 4/1563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1658 variables, 8/1571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1658 variables, 8/1579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1658 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 124/1782 variables, 48/1627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1782 variables, 48/1675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1782 variables, 12/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1782 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 8/1790 variables, 4/1691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1790 variables, 8/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1790 variables, 8/1707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1790 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 124/1914 variables, 48/1755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1914 variables, 48/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1914 variables, 12/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1914 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 8/1922 variables, 4/1819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1922 variables, 8/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1922 variables, 8/1835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1922 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 124/2046 variables, 48/1883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2046 variables, 48/1931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2046 variables, 12/1943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2046 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 8/2054 variables, 4/1947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2054 variables, 8/1955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2054 variables, 8/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2054 variables, 0/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 124/2178 variables, 48/2011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2178 variables, 48/2059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2178 variables, 12/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2178 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 8/2186 variables, 4/2075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2186 variables, 8/2083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2186 variables, 8/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2186 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 120/2306 variables, 48/2139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2306 variables, 48/2187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2306 variables, 12/2199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2306 variables, 0/2199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 8/2314 variables, 4/2203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2314 variables, 8/2211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2314 variables, 8/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2314 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 79/2393 variables, 36/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2393 variables, 36/2291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2393 variables, 10/2301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2393 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 4/2397 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2397 variables, 4/2307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2397 variables, 4/2311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2397 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 62/2459 variables, 24/2335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/2459 variables, 24/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2459 variables, 6/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/2459 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/2463 variables, 2/2367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/2463 variables, 4/2371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2463 variables, 4/2375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/2463 variables, 0/2375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 62/2525 variables, 24/2399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2525 variables, 24/2423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/2525 variables, 6/2429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2525 variables, 0/2429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 4/2529 variables, 2/2431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2529 variables, 4/2435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2529 variables, 4/2439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2529 variables, 0/2439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 62/2591 variables, 24/2463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2591 variables, 24/2487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2591 variables, 6/2493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2591 variables, 0/2493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 4/2595 variables, 2/2495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2595 variables, 4/2499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/2595 variables, 4/2503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/2595 variables, 0/2503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 62/2657 variables, 24/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/2657 variables, 24/2551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/2657 variables, 6/2557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/2657 variables, 0/2557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (OVERLAPS) 4/2661 variables, 2/2559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/2661 variables, 4/2563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/2661 variables, 4/2567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/2661 variables, 0/2567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (OVERLAPS) 62/2723 variables, 24/2591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/2723 variables, 24/2615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/2723 variables, 6/2621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/2723 variables, 0/2621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (OVERLAPS) 4/2727 variables, 2/2623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/2727 variables, 4/2627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/2727 variables, 4/2631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/2727 variables, 0/2631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (OVERLAPS) 62/2789 variables, 24/2655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/2789 variables, 24/2679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/2789 variables, 6/2685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/2789 variables, 0/2685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (OVERLAPS) 4/2793 variables, 2/2687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/2793 variables, 4/2691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/2793 variables, 4/2695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/2793 variables, 0/2695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (OVERLAPS) 62/2855 variables, 24/2719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/2855 variables, 24/2743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/2855 variables, 6/2749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/2855 variables, 0/2749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (OVERLAPS) 4/2859 variables, 2/2751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/2859 variables, 4/2755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/2859 variables, 4/2759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/2859 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (OVERLAPS) 62/2921 variables, 24/2783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/2921 variables, 24/2807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/2921 variables, 6/2813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/2921 variables, 0/2813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (OVERLAPS) 4/2925 variables, 2/2815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/2925 variables, 4/2819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/2925 variables, 4/2823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/2925 variables, 0/2823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (OVERLAPS) 62/2987 variables, 24/2847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/2987 variables, 24/2871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/2987 variables, 6/2877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/2987 variables, 0/2877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (OVERLAPS) 4/2991 variables, 2/2879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/2991 variables, 4/2883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/2991 variables, 4/2887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/2991 variables, 0/2887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (OVERLAPS) 62/3053 variables, 24/2911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/3053 variables, 24/2935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/3053 variables, 6/2941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/3053 variables, 0/2941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (OVERLAPS) 4/3057 variables, 2/2943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/3057 variables, 4/2947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/3057 variables, 4/2951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/3057 variables, 0/2951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (OVERLAPS) 62/3119 variables, 24/2975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/3119 variables, 24/2999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/3119 variables, 6/3005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/3119 variables, 0/3005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (OVERLAPS) 4/3123 variables, 2/3007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/3123 variables, 4/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/3123 variables, 4/3015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/3123 variables, 0/3015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (OVERLAPS) 62/3185 variables, 24/3039 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/3185 variables, 24/3063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/3185 variables, 6/3069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/3185 variables, 0/3069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 211 (OVERLAPS) 4/3189 variables, 2/3071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/3189 variables, 4/3075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/3189 variables, 4/3079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/3189 variables, 0/3079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 215 (OVERLAPS) 62/3251 variables, 24/3103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/3251 variables, 24/3127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/3251 variables, 6/3133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/3251 variables, 0/3133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 219 (OVERLAPS) 4/3255 variables, 2/3135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/3255 variables, 4/3139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/3255 variables, 4/3143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/3255 variables, 0/3143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 223 (OVERLAPS) 42/3297 variables, 22/3165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/3297 variables, 22/3187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/3297 variables, 6/3193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/3297 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 227 (OVERLAPS) 2/3299 variables, 1/3194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/3299 variables, 2/3196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/3299 variables, 2/3198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/3299 variables, 0/3198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 231 (OVERLAPS) 2/3301 variables, 2/3200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/3301 variables, 2/3202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/3301 variables, 1/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/3301 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 235 (OVERLAPS) 0/3301 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 3203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3665 ms.
Refiners :[Domain max(s): 1401/1401 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1401/1401 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/58 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 189/247 variables, 64/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 64/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/255 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 225/480 variables, 88/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 88/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 21/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:32] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 14/494 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/494 variables, 14/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/494 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 217/711 variables, 84/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/711 variables, 84/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/711 variables, 21/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:13:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/711 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/711 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 14/725 variables, 7/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/725 variables, 14/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/725 variables, 14/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/725 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 217/942 variables, 84/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/942 variables, 84/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/942 variables, 21/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/942 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 14/956 variables, 7/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/956 variables, 14/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/956 variables, 14/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/956 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 213/1169 variables, 84/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1169 variables, 84/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1169 variables, 21/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1169 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 14/1183 variables, 7/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1183 variables, 14/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1183 variables, 14/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1183 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 172/1355 variables, 72/1177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1355 variables, 72/1249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1355 variables, 19/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1355 variables, 1/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1355 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 10/1365 variables, 5/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1365 variables, 10/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1365 variables, 10/1294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1365 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 149/1514 variables, 59/1353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1514 variables, 59/1412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1514 variables, 15/1427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:13:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:13:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:13:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1514 variables, 4/1431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1514 variables, 0/1431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 10/1524 variables, 5/1436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1524 variables, 10/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1524 variables, 10/1456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1524 variables, 0/1456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 126/1650 variables, 50/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1650 variables, 50/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1650 variables, 13/1569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1650 variables, 0/1569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 8/1658 variables, 4/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1658 variables, 8/1581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1658 variables, 8/1589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:34] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/1658 variables, 1/1590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1658 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 124/1782 variables, 48/1638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1782 variables, 48/1686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1782 variables, 12/1698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:34] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1782 variables, 1/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1782 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 8/1790 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1790 variables, 8/1711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1790 variables, 8/1719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1790 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 124/1914 variables, 48/1767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1914 variables, 48/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1914 variables, 12/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:34] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:13:34] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:13:35] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:13:35] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:13:35] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:13:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:13:35] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 89 (INCLUDED_ONLY) 0/1914 variables, 7/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1914 variables, 0/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 8/1922 variables, 4/1838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1922 variables, 8/1846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1922 variables, 8/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1922 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 124/2046 variables, 48/1902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2046 variables, 48/1950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2046 variables, 12/1962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:35] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
At refinement iteration 98 (INCLUDED_ONLY) 0/2046 variables, 1/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2046 variables, 0/1963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 8/2054 variables, 4/1967 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2054 variables, 8/1975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2054 variables, 8/1983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2054 variables, 0/1983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 124/2178 variables, 48/2031 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2178 variables, 48/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2178 variables, 12/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2178 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 8/2186 variables, 4/2095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2186 variables, 8/2103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2186 variables, 8/2111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/2186 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 120/2306 variables, 48/2159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2306 variables, 48/2207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2306 variables, 12/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2306 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 8/2314 variables, 4/2223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2314 variables, 8/2231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2314 variables, 8/2239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/2314 variables, 0/2239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 79/2393 variables, 36/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2393 variables, 36/2311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/2393 variables, 10/2321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:36] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:13:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 123 (INCLUDED_ONLY) 0/2393 variables, 2/2323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:36] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
At refinement iteration 124 (INCLUDED_ONLY) 0/2393 variables, 1/2324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/2393 variables, 0/2324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 4/2397 variables, 2/2326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/2397 variables, 4/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/2397 variables, 4/2334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 129 (INCLUDED_ONLY) 0/2397 variables, 1/2335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/2397 variables, 0/2335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 62/2459 variables, 24/2359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/2459 variables, 24/2383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/2459 variables, 6/2389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/2459 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 4/2463 variables, 2/2391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/2463 variables, 4/2395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/2463 variables, 4/2399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/2463 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 62/2525 variables, 24/2423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/2525 variables, 24/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/2525 variables, 6/2453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:13:37] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:13:37] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:13:37] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2525/3301 variables, and 2456 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5011 ms.
Refiners :[Domain max(s): 1063/1401 constraints, Positive P Invariants (semi-flows): 303/401 constraints, State Equation: 1063/1401 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 8686ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions (Partial Free agglomeration) removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1401 transition count 1900
Applied a total of 201 rules in 82 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1401/1401 places, 1900/1900 transitions.
RANDOM walk for 40000 steps (32 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 25879 steps, run visited all 2 properties in 385 ms. (steps per millisecond=67 )
Probabilistic random walk after 25879 steps, saw 25342 distinct states, run finished after 386 ms. (steps per millisecond=67 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (NOT p0) p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 268 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 23552 steps with 17 reset in 207 ms.
FORMULA ShieldRVs-PT-100A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLCardinality-04 finished in 89927 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 3 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:13:39] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:13:39] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-06-01 20:13:39] [INFO ] Invariant cache hit.
[2024-06-01 20:13:41] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:13:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 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 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60990ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61010ms
Finished structural reductions in LTL mode , in 1 iterations and 63459 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-100A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLCardinality-06 finished in 63611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 31 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-06-01 20:14:42] [INFO ] Invariant cache hit.
[2024-06-01 20:14:43] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 20:14:43] [INFO ] Invariant cache hit.
[2024-06-01 20:14:45] [INFO ] Implicit Places using invariants and state equation in 1740 ms returned []
Implicit Place search using SMT with State Equation took 2442 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:14:45] [INFO ] Invariant cache hit.
(s526 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 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 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30037 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60992ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61011ms
Finished structural reductions in LTL mode , in 1 iterations and 63489 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 5218 ms.
Product exploration explored 100000 steps with 50000 reset in 5331 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100A-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100A-LTLCardinality-07 finished in 74151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 3 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 85 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:15:56] [INFO ] Computed 401 invariants in 12 ms
[2024-06-01 20:15:57] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-06-01 20:15:57] [INFO ] Invariant cache hit.
[2024-06-01 20:15:59] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
[2024-06-01 20:15:59] [INFO ] Redundant transitions in 326 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:15:59] [INFO ] Computed 401 invariants in 14 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 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 timeout
1)
(s340 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30028 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60887ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 40 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63626 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1052 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLCardinality-08 finished in 63797 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 3 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 79 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:17:00] [INFO ] Computed 401 invariants in 11 ms
[2024-06-01 20:17:01] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-06-01 20:17:01] [INFO ] Invariant cache hit.
[2024-06-01 20:17:02] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2258 ms to find 0 implicit places.
[2024-06-01 20:17:03] [INFO ] Redundant transitions in 325 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:17:03] [INFO ] Computed 401 invariants in 7 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30034 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60874ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60893ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 44 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63612 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-09
Stuttering criterion allowed to conclude after 1311 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-100A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLCardinality-09 finished in 63757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 30 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:18:04] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:18:05] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-06-01 20:18:05] [INFO ] Invariant cache hit.
[2024-06-01 20:18:06] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:18:06] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60896ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60913ms
Finished structural reductions in LTL mode , in 1 iterations and 63156 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 32743 steps with 24 reset in 233 ms.
FORMULA ShieldRVs-PT-100A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLCardinality-13 finished in 63475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 90 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:19:07] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:19:08] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-06-01 20:19:08] [INFO ] Invariant cache hit.
[2024-06-01 20:19:10] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2024-06-01 20:19:10] [INFO ] Redundant transitions in 311 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:19:10] [INFO ] Computed 401 invariants in 6 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30029 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 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 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30026 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 48 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63610 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-14
Stuttering criterion allowed to conclude after 1303 steps with 0 reset in 16 ms.
FORMULA ShieldRVs-PT-100A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLCardinality-14 finished in 63683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:20:11] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:20:12] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-06-01 20:20:12] [INFO ] Invariant cache hit.
[2024-06-01 20:20:13] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2292 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60848ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60864ms
Finished structural reductions in LTL mode , in 1 iterations and 63195 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-15
Product exploration explored 100000 steps with 145 reset in 794 ms.
Product exploration explored 100000 steps with 144 reset in 876 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 72 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:21:17] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:21:17] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 20:21:17] [INFO ] Invariant cache hit.
[2024-06-01 20:21:19] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
[2024-06-01 20:21:19] [INFO ] Redundant transitions in 302 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:21:19] [INFO ] Computed 401 invariants in 7 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 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 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60825ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60840ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 48 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63556 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 51 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 154 reset in 725 ms.
Product exploration explored 100000 steps with 147 reset in 879 ms.
Support contains 2 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 43 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:22:22] [INFO ] Invariant cache hit.
[2024-06-01 20:22:23] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-06-01 20:22:23] [INFO ] Invariant cache hit.
[2024-06-01 20:22:24] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
[2024-06-01 20:22:25] [INFO ] Redundant transitions in 299 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:22:25] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30029 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60770ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60785ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63435 ms. Remains : 1402/1402 places, 1901/1901 transitions.
Treatment of property ShieldRVs-PT-100A-LTLCardinality-15 finished in 194545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldRVs-PT-100A-LTLCardinality-00
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 81 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:23:26] [INFO ] Computed 401 invariants in 9 ms
[2024-06-01 20:23:27] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-06-01 20:23:27] [INFO ] Invariant cache hit.
[2024-06-01 20:23:28] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-06-01 20:23:28] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30026 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30032 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60851ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60866ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1402/1403 places, 1902/1903 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63216 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-00
Product exploration explored 100000 steps with 98 reset in 748 ms.
Product exploration explored 100000 steps with 98 reset in 926 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 71 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 42 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-06-01 20:24:31] [INFO ] Invariant cache hit.
[2024-06-01 20:24:32] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-06-01 20:24:32] [INFO ] Invariant cache hit.
[2024-06-01 20:24:33] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2024-06-01 20:24:34] [INFO ] Redundant transitions in 334 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:24:34] [INFO ] Computed 401 invariants in 9 ms
(s823 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30034 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60876ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1402 places, 1901/1902 transitions.
Applied a total of 0 rules in 45 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63550 ms. Remains : 1402/1402 places, 1901/1902 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 98 reset in 730 ms.
Product exploration explored 100000 steps with 99 reset in 909 ms.
Support contains 2 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 38 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:25:37] [INFO ] Invariant cache hit.
[2024-06-01 20:25:38] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-06-01 20:25:38] [INFO ] Invariant cache hit.
[2024-06-01 20:25:39] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
[2024-06-01 20:25:40] [INFO ] Redundant transitions in 346 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:25:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60831ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63578 ms. Remains : 1402/1402 places, 1901/1901 transitions.
Treatment of property ShieldRVs-PT-100A-LTLCardinality-00 finished in 194947 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldRVs-PT-100A-LTLCardinality-15
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 73 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:26:41] [INFO ] Computed 401 invariants in 10 ms
[2024-06-01 20:26:42] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-06-01 20:26:42] [INFO ] Invariant cache hit.
[2024-06-01 20:26:43] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2024-06-01 20:26:43] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30027 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30029 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60945ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60965ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1402/1403 places, 1902/1903 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63468 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Running random walk in product with property : ShieldRVs-PT-100A-LTLCardinality-15
Product exploration explored 100000 steps with 153 reset in 722 ms.
Product exploration explored 100000 steps with 143 reset in 911 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 43 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-06-01 20:27:47] [INFO ] Invariant cache hit.
[2024-06-01 20:27:47] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-01 20:27:47] [INFO ] Invariant cache hit.
[2024-06-01 20:27:49] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2024-06-01 20:27:49] [INFO ] Redundant transitions in 310 ms returned [600]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:27:49] [INFO ] Computed 401 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30038 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30027 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60982ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1402 places, 1901/1902 transitions.
Applied a total of 0 rules in 38 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63628 ms. Remains : 1402/1402 places, 1901/1902 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 138 reset in 695 ms.
Product exploration explored 100000 steps with 144 reset in 886 ms.
Support contains 2 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 38 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:28:52] [INFO ] Invariant cache hit.
[2024-06-01 20:28:53] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-06-01 20:28:53] [INFO ] Invariant cache hit.
[2024-06-01 20:28:54] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
[2024-06-01 20:28:55] [INFO ] Redundant transitions in 302 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:28:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30029 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 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 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30025 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63329 ms. Remains : 1402/1402 places, 1901/1901 transitions.
Treatment of property ShieldRVs-PT-100A-LTLCardinality-15 finished in 194860 ms.
[2024-06-01 20:29:56] [INFO ] Flatten gal took : 102 ms
[2024-06-01 20:29:56] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 20:29:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1403 places, 1903 transitions and 9200 arcs took 17 ms.
Total runtime 1542975 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="ShieldRVs-PT-100A"
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 ShieldRVs-PT-100A, 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-171683762000867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100A.tgz
mv ShieldRVs-PT-100A 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;